1363 search results - page 97 / 273 » The road coloring problem |
ICIP
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper we use the information in the chrominance bands to reconstruct color block transformed compressed images. For the luminance and the two chrominance channels, we de n...
FORTE
2007
15 years 1 months ago
2007
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows i...
112
click to vote
ANOR
2002
14 years 11 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
AI
2005
Springer
14 years 11 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...