Abstract
Graph Minor Theory, developed by Robertson and Seymour over two decades, provides powerful structural results about a wide family of graph classes (anything closed under deletion and contraction). In recent years, this theory has been extended and generalized to apply to many algorithmic problems. Bidimensionality theory is one approach to algorithmic graph minor theory. This theory provides general tools for designing fast (constructive, often subexponential) fixed-parameter algorithms, kernelizations, and approximation algorithms (often PTASs), for a wide variety of NP-hard graph problems for graphs excluding a fixed minor. For example, some of the most general algorithms for feedback vertex set and connected dominating set are based on bidimensionality. Another approach is “deletion and contraction decompositions”, which split any graph excluding a fixed minor into a bounded number of small-treewidth graphs. For example, this approach has led to some of the most general algorithms for graph coloring and the Traveling Salesman Problem on graphs. I will describe these and other approaches to efficient algorithms through graph minors.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demaine, E.D. (2010). Algorithmic Graph Minors and Bidimensionality. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)