Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

DOI10.1007/978-3-642-17514-5_8zbMath1311.05188OpenAlexW2161994079MaRDI QIDQ3060763

Qian-Ping Gu, Hisao Tamaki

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_8

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Graph Minors and Parameterized Algorithm Design ⋮ Forbidding Kuratowski Graphs as Immersions ⋮ A note on planar graphs with large width parameters and small grid-minors ⋮ Confronting intractability via parameters ⋮ The Parameterized Complexity of Graph Cyclability

This page was built for publication: Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size