Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction

DOI10.1007/11940128_3zbMATH Open1135.68509OpenAlexW2614797494MaRDI QIDQ5459097FDOQ5459097

Authors: Erik D. Demaine, Ken-ichi Kawarabayashi, Mohammad T. Hajiaghayi 

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_3

Recommendations

• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
• Algorithmic Graph Minors and Bidimensionality
• Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid
• Mathematical Foundations of Computer Science 2004

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83)

Cited In (3)

• Title not available (Why is that?)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

This page was built for publication: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459097)