134 search results - page 8 / 27 » Induced Subgraphs of Bounded Degree and Bounded Treewidth |
191
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
184
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
181
click to vote
MFCS
2007
Springer
16 years 24 days ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
168
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
165
click to vote
EJC
2008
15 years 6 months ago
2008
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...