Improved Bounds for the Flat Wall Theorem
From MaRDI portal
Publication:5363032
DOI10.1137/1.9781611973730.20zbMath1375.05254arXiv1410.0276OpenAlexW2950073768MaRDI QIDQ5363032
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.0276
Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Steiner trees for hereditary graph classes: a treewidth perspective ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Packing cycles in undirected group-labelled graphs ⋮ Clique‐width: Harnessing the power of atoms ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ A new proof of the flat wall theorem ⋮ Unnamed Item ⋮ Block elimination distance ⋮ Colouring square-free graphs without long induced paths ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
This page was built for publication: Improved Bounds for the Flat Wall Theorem
