Linear time low tree-width partitions and algorithmic consequences

@inproceedings{Nesetril2006LinearTL,
  title={Linear time low tree-width partitions and algorithmic consequences},
  author={Jaroslav Nesetril and Patrice Ossona de Mendez},
  booktitle={STOC},
  year={2006}
}
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree.For any class with bounded expansion C and any integer p there exists a constant N(C,p) so that the vertex set of any graph G ∈ C may be partitioned into at most N(C,p) parts, any i ≤ p parts of them induce a subgraph of tree-width at most (i-1) [12] (actually, of tree-depth [16] at most i, what is sensibly stronger). Such partitions are… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS, ESTIMATED 63% COVERAGE

52 Citations

05'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Graph minors

  • N. Robertson, P. Seymour
  • XVI. Excluding a nonplanar graph. Journal of…
  • 2003
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…