38 search results - page 7 / 8 » A Sublinear Bipartiteness Tester for Bounded Degree Graphs |
SIROCCO
2008
14 years 11 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
AI
2007
Springer
14 years 10 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
SODA
2012
ACM
13 years 6 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
TCS
2010
14 years 4 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
DM
2002
14 years 9 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...