1363 search results - page 35 / 273 » The road coloring problem |
CPM
2009
Springer
15 years 4 months ago
2009
Springer
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...
101
click to vote
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
DATE
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
JUCS
2006
14 years 9 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
ANOR
2005
14 years 9 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...