11 search results - page 1 / 3 » The Bidimensional Theory of Bounded-Genus Graphs |
MFCS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
SODA
2010
ACM
14 years 1 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
LATIN
2004
Springer
13 years 9 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
GD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...