Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Contraction obstructions for treewidth
Journal of Combinatorial Theory Series B
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computational study on bidimensionality theory based algorithm for longest path problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Survey: Subexponential parameterized algorithms
Computer Science Review
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor. This paper extends the theory of bidimensionality for graphs of bounded genus (which is a minor-excluding family). Specifically we show that, for any problem whose solution value does not increase under contractions and whose solution value is large on a grid graph augmented by a bounded number of handles, the treewidth of any bounded-genus graph is at most a constant factor larger than the square root of the problem's solution value on that graph. Such bidimensional problems include vertex cover, feedback vertex set, minimum maximal matching, dominating set, edge dominating set, r-dominating set, connected dominating set, planar set cover, and diameter. On the algorithmic side, by showing that an augmented grid is the prototype bounded-genus graph, we generalize and simplify many existing algorithms for such problems in graph classes excluding a minor. On the combinatorial side, our result is a step toward a theory of graph contractions analogous to the seminal theory of graph minors by Robertson and Seymour.