Subexponential Time Algorithms for Embedding H-Minor Free Graphs
From MaRDI portal
Publication:4598141
DOI10.4230/LIPIcs.ICALP.2016.9zbMath1388.68103OpenAlexW2551041103MaRDI QIDQ4598141
Jesper Nederlof, Tom C. van der Zanden, Hans L. Bodlaender
Publication date: 19 December 2017
Full work available at URL: https://doi.org/10.4230/lipics.icalp.2016.9
Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (10)
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering ⋮ Improved Lower Bounds for Graph Embedding Problems ⋮ Games, Puzzles and Treewidth ⋮ A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs ⋮ On the Exact Complexity of Polyomino Packing ⋮ On the exact complexity of polyomino packing ⋮ Enumerating Grid Layouts of Graphs ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ On the number of labeled graphs of bounded treewidth ⋮ Subgraph isomorphism on graph classes that exclude a substructure
This page was built for publication: Subexponential Time Algorithms for Embedding H-Minor Free Graphs
