Skip to Main content Skip to Navigation
Journal articles

Tree-width and large grid minors in planar graphs

Abstract : We show that for a planar graph with no g-grid minor there exists a tree-decomposition of width at most 5g - 6. The proof is constructive and simple. The underlying algorithm for the tree-decomposition runs in O(n(2) log n) time.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990485
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:13 PM
Last modification on : Thursday, September 7, 2017 - 1:03:36 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:23:45 PM

File

1362-5881-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990485, version 1

Collections

Citation

Alexander Grigoriev. Tree-width and large grid minors in planar graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2011, Vol. 13 no. 1 (1), pp.13--20. ⟨hal-00990485⟩

Share

Metrics

Record views

101

Files downloads

2485