A shorter proof of the graph minor algorithm
From MaRDI portal
Publication:2875195
DOI10.1145/1806689.1806784zbMath1293.05363OpenAlexW2115607023MaRDI QIDQ2875195
Ken-ichi Kawarabayashi, Paul Wollan
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806784
Related Items (25)
Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ Planar Disjoint-Paths Completion ⋮ Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs ⋮ The structure of graphs with a vital linkage of order 2 ⋮ Planar disjoint-paths completion ⋮ Irrelevant vertices for the planar disjoint paths problem ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Effective computation of immersion obstructions for unions of graph classes ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Combing a Linkage in an Annulus ⋮ Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm ⋮ The disjoint paths problem in quadratic time ⋮ Linkless and flat embeddings in 3-space ⋮ Confronting intractability via parameters ⋮ Tight Bounds for Linkages in Planar Graphs ⋮ The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs ⋮ Fast minor testing in planar graphs ⋮ Unnamed Item ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor ⋮ The Parameterized Complexity of Graph Cyclability ⋮ Block elimination distance ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
This page was built for publication: A shorter proof of the graph minor algorithm
