Sciweavers

40 search results - page 1 / 8
» The Interval Constrained 3-Coloring Problem
Sort
View
LATIN
2010
Springer
13 years 3 months ago
The Interval Constrained 3-Coloring Problem
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit&a...
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
13 years 2 months ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
13 years 9 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
13 years 11 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...