Increasing the efficiency of graph colouring algorithms with a representation based on vector operations

Journal of Software

Volumn 1, Issue 2, 2006, Pages 24-33

  Juhos, István ^a   van Hemert, Jano I ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Colouring strategies; Dsatur; Evolutionary algorithm; Graph colouring; Node merging; Representation

Indexed keywords

APPROXIMATION ALGORITHMS; EFFICIENCY; GRAPH THEORY; PROBLEM SOLVING;

DSATUR; GRAPH COLOURING; HARD PROBLEMS; PRACTICAL PROBLEMS; REPRESENTATION; TIME COMPLEXITY; VECTOR OPERATIONS;

EVOLUTIONARY ALGORITHMS;

EID: 47249086165     PISSN: 1796217X     EISSN: None     Source Type: Journal    
DOI: 10.4304/jsw.1.2.24-33     Document Type: Article

References (22)

1. D. de Werra, "An introduction to timetabling," European Journal of Operations Research, vol. 19, pp. 151-162, 1985.
2. P. Briggs, "Register allocation via graph coloring," Rice University, Houston, TX, USA, Tech. Rep. TR92-183, 24, 1998. [Online]. Available: citeseer.ist.psu.edu/ briggs92register.html
3. M. Garey, D. Johnson, and H. So, "An application of graph colouring to printed circuit testing," IEEE Transaction on Circuits and Systems, vol. CAS-23, pp. 591-599, 1976.
4. M. Garey and D. Johnson, Computers and Instractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W.H. Freeman, 1979.
5. B. Craenen, A. Eiben, and J. van Hemert, "Comparing evolutionary algorithms on binary constraint satisfaction problems," IEEE Transactions on Evolutionary Computation, vol. 7, no. 5, pp. 424-444, 2003.
6. I. Juhos, A. Tóth, and J. van Hemert, "Binary merge model representation of the graph colouring problem," in Evolutionary Computation in Combinatorial Optimization, ser. LNCS, G. Raidl and J. Gottlieb, Eds., vol. 3004. Springer, 2004, pp. 124-134.
7. I. Juhos, A. Tóth, and J. van Hemert, "Heuristic colour assignment strategies for merge models in graph colouring," in Evolutionary Computation in Combinatorial Optimization, ser. LNCS, vol. 3448. Springer, 2005, pp. 132-143.
8. P. Briggs and L. Torczon, "An efficient representation for sparse sets," ACM Lett. Program. Lang. Syst., vol. 2, no. 1-4, pp. 59-69, 1993.
9. D. Brélaz, "New methods to color the vertices of a graph," Communications of the ACM, vol. 22, no. 4, pp. 251-256, Apr. 1979.
10. CNET, "Xbox specs revealed," 05 2005, accessed: Nov. 10, 2005. [Online]. Available: http://cnet.com/Xbox???????10433-5705372.html
11. J. Comba, C. Dietrich, C. Pagot, and C. Scheidegger, "Computation on gpus: from a programmable pipeline to an efficient stream processor," Revista de Informatica Teorica e Aplicada, vol. 10, no. 1, pp. 41-70, 2003. [Online]. Available: http://www.sci.utah.edu/cscheid/pubs/ritasurvey.pdf
12. C. J. Thompson, S. Hahn, and M. Oskin, "Using modern graphics architectures for general-purpose computing: a framework and analysis," in MICRO 35: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture. Los Alamitos, CA, USA: IEEE Computer Society Press, 2002, pp. 306-317.
13. G. R. Grimmet and C. J. H. McDiarmid, "On colouring random graphs," Mathematical Proceedings of the Cambridge Philosophical Society, vol. 77, pp. 313-324, 1975.
14. C. McDiarmid, "Determining the chromatic number of a graph," SIAM Journal on Computing, vol. 8, no. 1, pp. 1-14, 1979.
15. J. Culberson, "Iterated greedy graph coloring and the difficulty landscape," University of Alberta, Dept. of Computing Science, Tech. Rep. TR 92-07, 1992.
16. B. Bollobás, "The chromatic number of random graphs," Combinatorica, vol. 8, no. 1, pp. 49-55, 1988.
17. S. Golomb and L. Baumert, "Backtrack programming," ACM, vol. 12, no. 4, pp. 516-524, Oct. 1965.
18. T. Bäck, Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
19. T. Bäck, D. Fogel, and Z. Michalewicz, Eds., Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Oxford University Press, 1997.
20. D. Johnson and M. Trick, Cliques, Coloring, and Satisfiability. American Mathematical Society, DIMACS, 1996.
21. J. Mycielski, "Sur le coloriage des graphes (for colouring graphs)," Colloquim Mathematiques, vol. 3, no. 161, 1955.
22. P. Cheeseman, B. Kenefsky, and W. Taylor, "Where the really hard problems are," in Proceedings of the IJCAI'91, 1991, pp. 331-337.