Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
On testable properties in bounded degree graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Testing monotonicity over graph products
Random Structures & Algorithms
On the Query Complexity of Testing Orientations for Being Eulerian
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Benefits of Adaptivity in Property Testing of Dense Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Towards privacy for social networks: a zero-knowledge based definition of privacy
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Distance approximation in bounded-degree and general sparse graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Testing the (s,t)-disconnectivity of graphs and digraphs
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
Principles of network computing
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Constant-time algorithms for sparsity matroids
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the parameterized complexity of the workflow satisfiability problem
Proceedings of the 2012 ACM conference on Computer and communications security
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.01 |
In this paper we consider the problem of testing bipartiteness of general graphs. The problem has previously been studied in two models, one most suitable for dense graphs and one most suitable for bounded-degree graphs. Roughly speaking, dense graphs can be tested for bipartiteness with constant complexity, while the complexity of testing bounded-degree graphs is $\tilde{\Theta}(\sqrt{n})$, where $n$ is the number of vertices in the graph (and $\tilde{\Theta}(f(n))$ means $\Theta(f(n)\cdot{\rm polylog}(f(n)))$). Thus there is a large gap between the complexity of testing in the two cases.In this work we bridge the gap described above. In particular, we study the problem of testing bipartiteness in a model that is suitable for all densities. We present an algorithm whose complexity is $\tilde{O}(\min(\sqrt{n},n^2/m))$, where $m$ is the number of edges in the graph, and we match it with an almost tight lower bound.