Constraint propagation in graph coloring

Journal of Heuristics

Volumn 8, Issue 1, 2002, Pages 83-107

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Binary constraints; Clique; Edge consistency; Heuristic algorithms; Lower bound; Vertex coloring

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; THEOREM PROVING;

BINARY CONSTRAINTS; CHROMATIC NUMBER; CONSTRAINT PROPAGATION; CONSTRAINT SATISFACTION PROBLEM; GRAPH COLORING; HEURISTIC ALGORITHMS; VERTEX COLORING;

OPTIMIZATION;

EID: 0036178394     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013665718444     Document Type: Article

References (29)

1. Finding maximum cliques in arbitrary and in special graphs
2. Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
3. Incorporating efficient operations research algorithms in constraint-based scheduling
4. Coloring algorithms and their application to project scheduling
5. A fast and simple local search for graph coloring
6. Iterative coloring extension of a maximum clique
7. A lower bound on the chromatic number of mycielski graphs
8. Tuning the cache performance of a local search graph coloring algorithm
9. CHECKCOL: Improved local search for graph coloring
10. Fundamental properties of neighborhood substitution in constraint satisfaction problems
11. Network-based heuristics for constraint-satisfaction problems
12. Genetic and hybrid algorithms for graph coloring
13. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique and satisfiability
14. A sufficient condition of the backtrack free search
15. Some simplified NP-complete graph problems
16. Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning
17. Precoloring extension with fixed color bound
18. Consistency in networks of relations
19. A column generation approach for graph coloring
20. Distributed coloration neighborhood search
21. Sur le coloriage des graphes
22. A pruning procedure for exact graph coloring
23. An improved algorithm for exact graph coloring
24. Solution of advances problem no. 4526