9 search results - page 1 / 2 » A Separator Theorem for Graphs with an Excluded Minor and it... |
STOC
1990
ACM
13 years 9 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
CPC
2010
13 years 2 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...