71 search results - page 1 / 15 » Lower Bounds for Testing Bipartiteness in Dense Graphs |
COCO
2004
Springer
13 years 10 months ago
2004
Springer
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 g...
COMBINATORICA
1999
13 years 4 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
STOC
1996
ACM
13 years 9 months ago
1996
ACM
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
ECCC
2008
13 years 5 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...