Tight Bounds for Testing Bipartiteness in General Graphs
Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-45198-3_29
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2003
Authors
Publisher
Springer Berlin Heidelberg