Efficient algorithms for finding critical subgraphs

Discrete Applied Mathematics

Volumn 156, Issue 2, 2008, Pages 244-266

  Desrosiers, C ^a   Galinier, P ^a   Hertz, A ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Chromatic number; Critical subgraphs; Graph coloring

Indexed keywords

ALGORITHMS; BENCHMARKING; COLORING; COMPUTATIONAL METHODS;

CHROMATIC NUMBER; CRITICAL SUBGRAPHS; GRAPH COLORING; VERTEX-CRITICAL AND EDGE-CRITICAL SUBGRAPHS;

GRAPHIC METHODS;

EID: 37149037448     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.019     Document Type: Article

References (23)

1. Aragon C.R., Johnson D.S., Mcgeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation. Part II, Graph coloring and number partitioning. Oper. Res. 39 (1991) 378-406
2. Brown J.R. Chromatic scheduling and the chromatic number problem. Management Sci. 19/4 (1972) 456-463
3. Chinneck J.W. Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. Comput. 9 2 (1997)
4. J.W. Chinneck, Feasibility and viability, in: T. Gal, H.J. Greenberg (Eds.), Advances in Sensitivity Analysis and Parametric Programming, International Series in Operations Research and Management Science, Kluwer Academic Publishers, Dordrecht, vol. 6, 1997.
5. Fleurent C., and Ferland J.A. Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63 (1996) 437-461
6. Galinier P., and Hao J.K. Hybrid evolutionary algorithms for graph coloring. J. Combin. Optimization 3 4 (1999) 379-397
7. Galinier P., and Hertz A. Solution techniques for the large set covering problem. Discrete. Appl. Math. 155 (2007) 312-326
8. Galinier P., A ., and Hertz. A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006) 2547-2562
9. P. Galinier, A. Hertz, N. Zufferey, An adaptive memory algorithm for the k-colouring problem, Research Report G-2003-35, Discrete Appl. Math. this issue, doi: 10.1016/j.dam.2006.07.017.
10. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freman and Company, NY
11. Glover F. Tabu search-part I. ORSA J. Comput. 1 3 (1989) 190-206
12. Glover F. Tabu search-part II. ORSA J. Comput. 2 1 (1989) 4-32
13. Herrmann F., and Hertz A. Finding the chromatic number by means of critical graphs. ACM J. Exp. Algorithmics 7 10 (2002) 1-9
14. Hertz A., and de Werra D. Using tabu search for graph coloring. Computing 39 (1987) 345-351
15. D.S. Johnson, M.A. Trick, in: Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996.
16. Kubale M., and Jackowski B. A generalized implicit enumeration algorithm for graph coloring. Comm. ACM 28 4 (1985) 412-418
17. Mackworth A.K. Constraint satisfaction. In: Shapiro S.C. (Ed). Encyclopedia on Artificial Intelligence (1987), Wiley, NY
18. Mehrotra A., and Trick M.A. A column generation approach for exact graph coloring. INFORMS J. Comput. 8 (1996) 344-354
19. C. Morgenstern, Distributed coloration neighborhood search, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, vol. 26, Providence, RI, 1996, pp. 335-357.
20. Peemöller J. A correction to Brélaz's modification of Brown's coloring algorithm. Comm. ACM 26 8 (1983) 593-597
21. Tsang E. Foundations of Constraint Satisfaction (1993), Academic Press, London
22. van Loon J. Irreducibly inconsistent systems of linear inequalities. European J. Oper. Res. 8 (1981) 283-288
23. de Werra D. Heuristics for graph coloring. Computing 7 (1990) 191-208