2713 search results - page 13 / 543 » Parameterized Tree Systems |
118
Voted
DEXA
2005
Springer
15 years 11 months ago
2005
Springer
125
Voted
TACAS
2000
Springer
15 years 9 months ago
2000
Springer
185
click to vote
ISAAC
2009
Springer
16 years 12 days ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
160
click to vote
COCOA
2007
Springer
16 years 13 hour ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...