Searching for "Lower Bounds for Testing Bipartiteness in Dense Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Lower Bounds for Testing Bipartiteness in Dense Graphs
by Andrej Bogdanov, Luca Trevisan — 2002 — Electronic Colloquium on Computational Complexity
…Lower Bounds for Testing Bipartiteness in Dense Graphs Andrej Bogdanov # Luca Trevisan + November…
Cited by 8 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB