Sciweavers

Share
205 search results - page 1 / 41
» The Parameterized Complexity of Some Minimum Label Problems
Sort
View
WG
2009
Springer
9 years 4 months ago
The Parameterized Complexity of Some Minimum Label Problems
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...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
IWPEC
2009
Springer
9 years 4 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
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...
Panos Giannopoulos, Christian Knauer, Günter ...
COCOA
2007
Springer
9 years 4 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
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...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
CORR
2016
Springer
68views Education» more  CORR 2016»
3 years 6 months ago
The Parameterized Complexity of the Minimum Shared Edges Problem
We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p p...
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, ...
books