A Sublinear Bipartiteness Tester for Bounded Degree Graphs

13 years 4 months ago

Download www.cs.princeton.edu

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 length

Oded Goldreich, Dana Ron

Real-time Traffic

Algorithm | COMBINATORICA 1999 | Degree Graph | Sublinear-time Algorithm |

claim paper

» An Expansion Tester for Bounded Degree Graphs

» Sum Coloring of Bipartite Graphs with Bounded Degree

» Testing subgraphs in directed graphs

» Matchings in hypergraphs of large minimum degree

» A Note on Adaptivity in Testing Properties of Bounded Degree Graphs

» Acyclic improper colourings of graphs with bounded maximum degree

» Bandwidth expansion treewidth separators and universality for boundeddegree graphs

» Weighted Coloring on Planar Bipartite and Split Graphs Complexity and Improved Approximati...

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	COMBINATORICA
Authors	Oded Goldreich, Dana Ron

Comments (0)

Sciweavers

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

Algorithm | COMBINATORICA 1999 | Degree Graph | Sublinear-time Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers