An exact method for graph coloring
Authors:
- 1 August 2006
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (8) , 2189-2207
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A decomposition algorithm for network reliability evaluationDiscrete Applied Mathematics, 2000
- Hybrid Evolutionary Algorithms for Graph ColoringJournal of Combinatorial Optimization, 1999
- On a multiconstrained model for chromatic schedulingDiscrete Applied Mathematics, 1999
- Coloring by Tabu branch and bound1996
- Some sequential graph colouring algorithmsInternational Journal of Electronics, 1989
- Using tabu search techniques for graph coloringComputing, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A generalized implicit enumeration algorithm for graph coloringCommunications of the ACM, 1985
- An introduction to timetablingEuropean Journal of Operational Research, 1985
- New methods to color the vertices of a graphCommunications of the ACM, 1979