The Bidimensional Theory of Bounded-Genus Graphs

Abstract. 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 ...

• Type: Conference
• Year: 2004
• Where: MFCS
• Authors: Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
• Keywords: Bounded-genus Graph, Dominating Set, Graph Contractions, MFCS 2004