194 search results - page 1 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
WG
2009
Springer
13 years 11 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
COCOA
2007
Springer
13 years 10 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...
CPM
2010
Springer
13 years 9 months ago
2010
Springer
CJ
2008
13 years 4 months ago
2008
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...