Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COCO
2004
Springer

favoriteEmaildiscussreport

93views Algorithms» more COCO 2004»

Lower Bounds for Testing Bipartiteness in Dense Graphs

13 years 10 months ago

Lower Bounds for Testing Bipartiteness in Dense Graphs

Download www.cs.princeton.edu

We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and graphs that are -far from bipartite using ˜O(1/ 2 ) queries. We show that this is optimal for non-adaptive algorithms, up to polylogarithmic factors. We also show a lower bound of Ω(1/ 3/2 ) for adaptive algorithms.

Andrej Bogdanov, Luca Trevisan

Real-time Traffic

Adjacency Matrix Model | Bipartite Graphs | COCO 2004 | Testing Bipartiteness |

claim paper

Related Content

» A Sublinear Bipartiteness Tester for Bounded Degree Graphs

» Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs

» Improved Lower Bounds on the Randomized Complexity of Graph Properties

» A Lower Bound on the Size of SeriesParallel Graphs Dense in Long Paths

» Testing TriangleFreeness in General Graphs

» Characterizations of bipartite Steinhaus graphs

» Group testing in graphs

» FPRAS for computing a lower bound for weighted matching polynomial of graphs

» A combinatorial algorithm for weighted stable sets in bipartite graphs

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	COCO
Authors	Andrej Bogdanov, Luca Trevisan

Comments (0)