Diameter and Treewidth in Minor-Closed Graph Families

@article{Eppstein2000DiameterAT,
  title={Diameter and Treewidth in Minor-Closed Graph Families},
  author={D. Eppstein},
  journal={Algorithmica},
  year={2000},
  volume={27},
  pages={275-291}
}
  • D. Eppstein
  • Published 2000
  • Mathematics, Computer Science
  • Algorithmica
Abstract. It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a minor-closed family, if and only if some apex graph does not belong to the family. In particular, the O(D) bound above can be extended to bounded-genus graphs. As a consequence, we extend… Expand
Diameter and Treewidth in Minor-Closed Graph Families, Revisited
TLDR
This short paper characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter with a simple proof of Eppstein's characterization, which includes, e.g., planar graphs. Expand
Bidimensional Parameters and Local Treewidth
TLDR
This paper examines the question whether similar bounds can be obtained for larger minor-closed graph classes, and for general families of parameters including all the parameters where such a behavior has been reported so far. Expand
Bidimensional Parameters and Local Treewidth
TLDR
It is proved that, for a large family of graph parameters called contraction-bidimensional, a minor-closed graph family has the parameter-treewidth property if $\mathcal{F}$ has bounded local treewidth. Expand
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
TLDR
A polynomial-time algorithm for graphs with bounded treewidth is given which decides if a graph admits a decomposition, and gives suchA decomposition if it exists. Expand
Dominating Sets and Local Treewidth
TLDR
It is shown that a minor-closed graph family has the domination-treewidth property if and only if \(\mathcal{F}\) has bounded local treewidth. Expand
Local Tree-Width, Excluded Minors, and Approximation Algorithms
TLDR
A decomposition theorem for graphs with excluded minors says that such graphs can be decomposed into trees of graphs of almost bounded local tree-width, and it is shown that a number of combinatorial optimization problems have a polynomial time approximation scheme when restricted to a class of graphs with an excluded minor. Expand
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
TLDR
This work gives polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1.5 to have several applications in designing fully polynometric-time approximation schemes and fixed-parameter algorithms for many NP-complete problems on these graphs. Expand
Linearity of grid minors in treewidth with applications through bidimensionality
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an Ω(w) × Ω(w) grid graph as a minor. Thus grid minors suffice to certify that H-minorfree graphs have large treewidth,Expand
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
  • V. Lozin
  • Mathematics, Computer Science
  • ISAAC
  • 2008
TLDR
It is proved that the unit interval graphs constitute a minimal hereditary class of unbounded clique-width, and it is shown that list coloring is fixed parameter tractable in the class of unit intervals graphs. Expand
Parallel Planar Subgraph Isomorphism and Vertex Connectivity
We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. OurExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
Graph minors. V. Excluding a planar graph
We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in aExpand
Connectivity, graph minors, and subgraph multiplicity
  • D. Eppstein
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1993
TLDR
The results use a simple Ramsey-theoretic lemma that may be of independent interest and are well known that any planar graph contains at most O(n) complete subgraphs. Expand
A linear time algorithm for finding tree-decompositions of small treewidth
TLDR
Every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm that determines whether the treewidth of G is at most k, and if so, finds a treedecomposition of G withtreewidth at mostK. Expand
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems
TLDR
It is shown that the vertex set of any graph not containing an l -apex graph as a minor can be partitioned in linear time into 2 l sets inducing graphs with small treewidth. Expand
Quickly Excluding a Planar Graph
TLDR
A much better bound is proved on the tree-width of planar graphs with no minor isomorphic to a g × g grid and this is the best known bound. Expand
NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems
TLDR
An optimal NC algorithm for computing a partition of the vertex set of a given K4-free or K2, 3-free graph into two subsets each of which induces a forest is designed. Expand
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs
TLDR
This work suggests a general approach for constructing linear-time algorithms in the case where the graph G is defined by certain rules of composition and the desired subgraph H satisfies a property that is “regular” with respect to theserules of composition. 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
Subgraph isomorphism in planar graphs and related problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of smallExpand
Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs
TLDR
It is shown that for an integer k ≥ 2 and an n-vertex graph G without a K3,3 (resp., K5) minor, there are practical polynomial-time approximation schemes for various maximum induced-subgraph problems on planar graphs. Expand
...
1
2
3
...