A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–

DOI10.1137/1.9781611973105.30zbMath1423.05159OpenAlexW4246499806MaRDI QIDQ5741738

Ken-ichi Kawarabayashi, Martin Grohe, Bruce A. Reed

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7923f4dd95866891d0bfeeae521f5803b8b98b67

zbMATH Keywords

graph algorithmsgraph minorsdisjoint paths problem

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (9)

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Linear Time Parameterized Algorithms for Subset Feedback Vertex Set ⋮ Approximating sparse quadratic programs ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ The parameterized complexity of \(k\)-edge induced subgraphs ⋮ Computing with Tangles ⋮ A Linear-Time Parameterized Algorithm for Node Unique Label Cover ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs ⋮ Simple PTAS's for families of graphs excluding a minor

This page was built for publication: A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–