2713 search results - page 13 / 543 » Parameterized Tree Systems |
DEXA
2005
Springer
15 years 5 months ago
2005
Springer
TACAS
2000
Springer
15 years 3 months ago
2000
Springer
62
Voted
EMSOFT
2008
Springer
15 years 1 months ago
2008
Springer
118
Voted
ISAAC
2009
Springer
15 years 6 months 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...
93
Voted
COCOA
2007
Springer
15 years 5 months 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...