Algorithmic Graph Minors and Bidimensionality

DOI10.1007/978-3-540-79723-4_2MaRDI QIDQ3503573zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine

Publication date 5 June 2008

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79723-4_2

Mathematics Subject Classification ID

Graph minors (05C83) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Drawing
• Mathematical Foundations of Computer Science 2004
• The Bidimensional Theory of Bounded-Genus Graphs
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

Cited in

(11)

• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
• A shorter proof of the graph minor algorithm: the unique linkage theorem
• Graph minors and parameterized algorithm design
• scientific article; zbMATH DE number 2079336 (Why is no real title available?)
• scientific article; zbMATH DE number 795221 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• Bidimensionality and parameterized algorithms (invited talk)
• scientific article; zbMATH DE number 5874803 (Why is no real title available?)
• Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction
• Graph Drawing

This page was built for publication: Algorithmic Graph Minors and Bidimensionality

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