7 search results - page 1 / 2 » Bidimensional Parameters and Local Treewidth |
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 ...
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...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
LICS
2007
IEEE
13 years 10 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...
WAOA
2010
Springer
13 years 2 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...