Abstract
A sublinear-time algorithm is used to test whether a bounded degree graph is bipartite of far from being bipartite. Graphs are presented by incidence lists of bounded length d, and the testing algorithm can perform queries of the form: `who is the ith neighbor of vertex v'. For any graph, the graph vertices can be divided into disjoint subsets such that: the total number of edges between the different subsets is small; and each subset itself exhibits a certain mixing property that is useful in the analysis.
| Original language | English |
|---|---|
| Pages (from-to) | 289-298 |
| Number of pages | 10 |
| Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA Duration: 23 May 1998 → 26 May 1998 |