You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Tight Bounds for Testing Bipartiteness in General Graphs
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Springer, Berlin, Heidelberg, January 2003
Tali Kaufman, Michael Krivelevich, Dana Ron
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Professor > Associate Professor||1||14%|
|Student > Master||1||14%|
|Readers by discipline||Count||As %|
|Agricultural and Biological Sciences||1||14%|
|Physics and Astronomy||1||14%|