A minimal-state processing search algorithm for graph coloring problems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 7, 2000, Pages 1420-1430

  Funabiki, Nobuo ^a   Ashino, Teruo Hig ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

DIMACS; Graph coloring; Heuristic algorithm; MIPS_CLR; Simulation

Indexed keywords

ALGORITHMS; COLOR; COMPUTER SIMULATION; HEURISTIC METHODS;

GRAPH COLORING PROBLEM; HEURISTIC GRAPH COLORING ALGORITHM; MAXIMUM CLIQUE ALGORITHM; MINIMAL STATE PROCESSING SEARCH ALGORITHM; SIMPLE GREEDY ALGORITHM;

GRAPH THEORY;

EID: 0034225034     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, 1979.
2. S.H. Gerez, Algorithms for VLSI design automation, Wiley, 1998.
3. T.-K. Woo, S.Y.W. Su, and R. Newman-Wolfe, "Resource allocation in a dynamically partitionable bus network using a graph coloring algorithm," IEEE Trans. Commun., vol.39, no.12, pp.1794-1801, Dec. 1991.
4. N. Funabiki, N. Okutani, and S. Nishikawa, "A three-stage heuristic combined neural network algorithm for channel assignment in cellular mobile systems," to appear in IEEE Trans. Veh. Technol., 2000.
5. D.S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. Syst. Sci., vol.9, pp.256-278, 1974.
6. D. Brèlaz, "New methods to color the vertices of a graph," Commun. ACM, vol.22, no.4, pp.251-256, April 1979.
7. F.T. Leighton, "A graph coloring algorithm for large scheduling problems," J. Res. Natl. Bur. Standards, vol.84, pp.489-506, 1979.
8. B. Bollobas and A. Thomason, "Random graphs of small order," Ann. Discrete Math., vol.28, pp.47-97, 1985.
9. A. Hertz and D. de Werra, "Using tabu search techniques for graph coloring," Computing, vol.39, pp.345-351, 1987.
10. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, "Optimization by simulated annealing: An experimental evaluation, part II (graph coloring and number partitioning)," Operations Research, vol.39, pp.378-406, 1991.
11. A. Blum, "New approximation algorithms for graph coloring," J. ACM, vol.41, no.3, pp.470-516, May 1994.
12. D. Karger, R. Motwani, and M. Sudan, "Approximate graph coloring by semidefinite programming," J. ACM, vol.45, no.2, pp.246-265, March 1998.
13. A.E. Eiben, J.K. Van Der Hauw, and J.I. Van Hemert, "Graph coloring with adaptive evolutionary algorithms," J. Heuristics, vol.4, pp.25-246, 1998.
14. ftp://dimacs.rutgers.edu/pub/challenge/graph/.
15. J.C. Culberson and F. Luo, "Exploring the A:-colorable landscape with iterated greedy," DIMACS Ser. Discrete Math., vol.26, pp.245-284, 1996.
16. F. Glover, M. Parker, and J. Ryan, "Coloring by tabu branch and bound," DIMACS Ser. Discrete Math., vol.26, pp.285-307, 1996.
17. G. Lewandowski and A. Condon, "Experiments with paral-lel graph coloring heuristics and applications of graph coloring," DIMACS Ser. Discrete Math., vol.20, pp.309-335, 1996.
18. C.A. Morgenstern, "Distributed coloration neighborhood search," DIMACS Ser. Discrete Math., vol.26, pp.335-357, 1996.
19. E.G. Sewell, "An improved algorithm for exact graph coloring," DIMACS Ser. Discrete Math., vol.26, pp.359-373, 1996.
20. C. Fleurent and J.A. Ferland, "Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability," DIMACS Ser. Discrete Math., vol.26, pp.619-652, 1996.
21. A. Jagota, "An adaptive, multiple restarts neural network algorithm for graph coloring," European J. Operations Research, vol.93, pp.257-270, 1996.
22. K. Nonobe and T. Ibaraki, "A tabu search approach to the constraint satisfaction problem as a general problem solver," European J. Operations Research, vol.106, pp.599-623, 1998.
23. D. Kirovski and M. Potkonjak, "Efficient coloring of a large spectrum of graphs," Proc. Design Automat. Conf., pp.427-432, 1998.
24. N. Funabiki and T. Higashino, "A proposal of a two-stage discrete optimization method for the maximum clique problem," Proc. NOLTA, pp. 163-166, Nov. 1999.
25. T.H, Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, The MIT Press, 1989.