Tight Bounds for Testing Bipartiteness in General Graphs

SIAM Journal on Computing 2004 / 01 Vol. 33; Iss. 6

Tight Bounds for Testing Bipartiteness in General Graphs

Kaufman, Tali, Krivelevich, Michael, Ron, Dana
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
33
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/s0097539703436424
Date:
January, 2004
File:
PDF, 448 KB
english, 2004
Conversion to is in progress
Conversion to is failed