Sciweavers

7 search results - page 1 / 2
» Bipartite minors
Sort
View
IPCO
1998
125views Optimization» more  IPCO 1998»
13 years 5 months ago
A Characterization of Weakly Bipartite Graphs
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...
Bertrand Guenin
JCT
2008
84views more  JCT 2008»
13 years 3 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
WWW
2008
ACM
14 years 4 months ago
Behavioral classification on the click graph
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
Martin Szummer, Nick Craswell
FOCS
2009
IEEE
13 years 10 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
STACS
2001
Springer
13 years 8 months ago
Evasiveness of Subgraph Containment and Related Properties
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
Amit Chakrabarti, Subhash Khot, Yaoyun Shi