11 search results - page 1 / 3 » Fast Algorithms for Hard Graph Problems: Bidimensionality, M... |
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...
LATIN
2004
Springer
13 years 10 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 ...
MFCS
2004
Springer
13 years 10 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....
STACS
2010
Springer
13 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...