- Preview Available
- Scholarly Journal
Tight Bounds for Testing Bipartiteness in General Graphs
Kaufman, Tali; Krivelevich, Michael; Ron, Dana.
SIAM Journal on Computing; Philadelphia Vol. 33, Iss. 6, (2004): 43.
DOI:10.1137/S0097539703436424
This is a limited preview of the full PDF
Try and log in through your library or institution to see if they have access.