A simpler algorithm and shorter proof for the graph minor decomposition
From MaRDI portal
Publication:5419115
DOI10.1145/1993636.1993697zbMath1288.05257OpenAlexW1998811202MaRDI QIDQ5419115
Ken-ichi Kawarabayashi, Paul Wollan
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993697
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Approximating sparse quadratic programs ⋮ Catalan structures and dynamic programming in \(H\)-minor-free graphs ⋮ Explicit linear kernels for packing problems ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ Explicit bounds for graph minors ⋮ Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor ⋮ Computing with Tangles ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: A simpler algorithm and shorter proof for the graph minor decomposition
