A linear-time algorithm to find a separator in a graph excluding a minor

@article{Reed2009ALA,
  title={A linear-time algorithm to find a separator in a graph excluding a minor},
  author={B. Reed and D. Wood},
  journal={ACM Trans. Algorithms},
  year={2009},
  volume={5},
  pages={39:1-39:16}
}
  • B. Reed, D. Wood
  • Published 2009
  • Mathematics, Computer Science
  • ACM Trans. Algorithms
Let <i>G</i> be an <i>n</i>-vertex <i>m</i>-edge graph with weighted vertices. A pair of vertex sets <i>A</i>, <i>B</i> ⊆ <i>V</i>(<i>G</i>) is a 2/3<i>-separation</i> of <i>order</i> |<i>A</i> ∩ <i>B</i>| if <i>A</i> ∪ <i>B</i> = <i>V</i>(<i>G</i>), there is no edge between <i>A</i> − <i>B</i> and <i>B</i> − <i>A</i>, and both <i>A</i> − <i>B</i> and <i>B</i> − <i>A</i> have weight at most 2/3 the total weight of <i>G</i>. Let ℓ ∈ Z<sup>+</sup> be fixed. Alon et al. [1990] presented an… Expand
Approximating Small Balanced Vertex Separators in Almost Linear Time
TLDR
A randomized Las Vegas algorithm is given that approximates a small balanced vertex separator of G in almost linear time and obtains an \(\alpha +\varepsilon )separator of size K in time. Expand
Approximating Small Balanced Vertex Separators in Almost Linear Time
For a graph G with n vertices and m edges, we give a randomized Las Vegas algorithm that approximates a small balanced vertex separator of G in almost linear time. More precisely, we show theExpand
Structured recursive separator decompositions for planar graphs in linear time
TLDR
This paper provides an algorithm for computing r--divisions with few holes in linear time and improves upon the decomposition algorithm used in the state-of-the-art algorithm for minimum st--cut, removing one of the bottlenecks in the overall running time of their algorithm. Expand
Hitting topological minors is FPT
TLDR
This work improves upon the algorithm of Golovach et al. Expand
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
TLDR
This paper shows that for all fixed $\epsilon > 0$ and fixed sufficiently large $t \geq t(\ep silon)$, if d(G) \geqi (2+\epsil on)g(t)$, then it can be found this $K_{t}$-minor in linear time. Expand
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
TLDR
This work proves that the extension complexity of the spanning tree polytope of every connected n-vertex graph in G is O(n), and gives two proofs of this result, one is a direct construction of the extended formulation, the other is via communication protocols. Expand
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
  • J. Fox, F. Wei
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • 2020
TLDR
The maximum number of cliques a graph on n vertices with a forbidden clique subdivision or immersion can have is at most $2^{t+\log^2 t}n$, which improves on the best known exponential constant by Lee and Oum. Expand
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
  • Christian Wulff-Nilsen
  • Mathematics, Computer Science
  • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • 2011
TLDR
A small polynomial time dependency on h is interested in and an algorithm to find an $O(h\sqrt{n\log n})-size separator or report that G has a $K_h$-minor in $O(\poly(h)n^{5/4 + \epsilon})$ time for any constant $\epssilon &gt, 0$. Expand
Short and Simple Cycle Separators in Planar Graphs
TLDR
This work provides an implementation of an algorithm that, given a triangulated planar graph with m edges, returns a simple cycle that is a 3/4-balanced separator consisting of at most √8m edges, the first implementation of such a cycle separator algorithm with a worst-case guarantee on the cycle length. Expand
Number of Cliques in Graphs with a Forbidden Subdivision
TLDR
It is proved that for all positive integers $t$, every $n$-vertex graph with no $K_t$-subdivision has at most $2^{50t}n$ cliques, and asymptotically, such graphs contain at most £2^{(5+o(1)t)n}n cliques. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 79 REFERENCES
Maximum matching in graphs with an excluded minor
TLDR
A randomized algorithm that extends a previous randomized algorithm of Mucha and Sankowski, having the same running time, that finds a maximum matching in a planar graphs and a deterministic algorithm with a running time of 2.19 seconds for counting the number of perfect matchings in graphs with bounded genus. Expand
Constant factor approximation of vertex-cuts in planar graphs
TLDR
A structural theorem is proved for planar graphs, showing the existence of a near-optimal quotient vertex-cut whose high-level structure is that of a bounded-depth tree and an algorithm is developed that optimizes over such complex structures in running time that depends (exponentially) not on the size of the structure, but rather only on its depth. Expand
Separators for sphere-packings and nearest neighbor graphs
TLDR
This result implies that every triangulated planar graph is isomorphic to the intersection graph of a disk-packing, which gives a new geometric proof of the planar separator theorem of Lipton and Tarjan, but also generalizes it to higher dimensions. Expand
Reduced constants for simple cycle graph separation
TLDR
If G is an n vertex maximal planar graph and δ≤1 3, then the vertex set of G can be partitioned into three sets A, B, C such that neither A nor B has weight exceeding 1−δ, and C is a simple cycle with no more than 2√n+O(1) vertices. Expand
A separator theorem for graphs with an excluded minor and its applications
TLDR
It follows that for any fixed graph H, given a graph G with n vertices and with no H-minor one can approximate the size of the maximum independent set of G up to a relative error of 1/ √ log n in polynomial time, find that size exactly and solve any sparse system of n linear equations in n unknowns in time O(n). Expand
Divide-and-conquer approximation algorithms via spreading metrics
TLDR
A polynomial time approximation algorithm is presented for problems modeled by the divide-and-conquer paradigm, such that all subgraphs for which the optimization problem is nontrivial have large diameters. Expand
Finding small balanced separators
TLDR
This paper gives a randomized algorithm that finds an α-separator of size k in the given graph, unless the graph contains an (α+ε)-separators of size strictly less than k, in which case the algorithm finds one such separator. Expand
A Separator Theorem for Graphs of Bounded Genus
TLDR
The main result of this paper is that if the authors can draw a graph on a surface of genus g, then they can bisect it by removing $O(\sqrt{gn})$ vertices, best possible to within a constant factor. Expand
Separators in Graphs with Negative and Multiple Vertex Weights
TLDR
It is shown that if the vertices of the graph have real-valued weights, which may be positive or negative, then the graph can be divided exactly in half according to weight. Expand
Planar Separators
TLDR
The authors give a short proof of a theorem of Lipton and Tarjan, that, for every planar graph with n > 0 vertives, there is a partition (A, B, C,) of its vertex set such that no vertex in A is adjacent to any vertex in B. Expand
...
1
2
3
4
5
...