Highly Influenced

# 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} }

- Published in STOC 2006
DOI:10.1145/1132516.1132575

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.

#### Citation Statistics

#### 52 Citations

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

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential