Firefly inspired distributed graph coloring algorithms

Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008

Volumn , Issue , 2008, Pages 211-217

  Lee, Sof Anthony ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Distributed algorithms; Graph coloring; Phase coupled oscillators

Indexed keywords

BIOLUMINESCENCE; DISTRIBUTED PARAMETER NETWORKS; FIRE PROTECTION; GRAPH THEORY; OSCILLATORS (ELECTRONIC); OSCILLATORS (MECHANICAL); PARALLEL ALGORITHMS;

COMPLETE GRAPHS; DISTRIBUTED ALGORITHMS; EXISTING METHODS; GLOBAL CONTROLS; GRAPH COLORING; K-PARTITE GRAPHS; MODEL-BASED; PHASE COUPLED OSCILLATORS; SYNCHRONIZATION PROCESS;

COLORING;

EID: 62749155042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. I. Aihara, H. Kitahata, K. Aihara, and K. Yoshikawa, "Periodic rhythms and anti-phase synchronization in calling behaviours of Japanese rain frogs," vol. 2006: University of Tokyo, http://www.i.u-tokyo.ac.jp/mi/mi-e. htm, 2006.
2. S. Lee and R. Lister, "Experiments in the Dynamics of Phase Coupled Oscillators When Applied to Graph Colouring," presented at The thirty-first Australasian Computer Science Conference (ACSC2008), Wollongong, 2008.
3. D. Attenborough, The trials of life. London: William Collins Sons & Co and BBC books, 1990.
4. E. Buck and J. Buck, "Synchronous fireflies," Scientific American, pp. 74-85, 1976.
5. R. E. Mirollo and S. H. Strogatz, "Synchronization of Pulse-Coupled Biological Oscillators," SIAM Journals on Applied Mathematics, vol. 50, pp. 1645-1662, 1990.
6. Y. W. Hong and A. Scaglione, "Time synchronization and reach-back communications with pulse-coupled oscillators for UWB wireless ad hoc networks," presented at Proceedings of the IEEE conference on Ultra Wideband Systems and Technologies, Reston, VA, 2003.
7. D. Lucarelli and I.-J. Wang, "Decentralized Synchronization Protocols with Nearest Neighbor Communication," in SenSys'04. Baltimore, Maryland: ACM, 2004.
8. G. Werner-Allen, G. Tewari, A. Patel, M. Welsh, and R. Nagpal, "Firefly-Inspired Sensor Network Synchronicity with Realistic Radio Effects," in SenSys'05. San Diego, California: ACM, 2005.
9. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biological Cybernetics, pp. 141-152, 1985.
10. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the Theory of NP-Completeness: W. H. Freeman, 1979.
11. A. Blum, "New approximation algorithms for graph coloring," Journal of the Association for Computing Machinery, vol. 41, pp. 470-516, 1994.
12. C. W. Wu, Synchronization in coupled chaotic circuits and systems. Singapore: World Scientific Publishing Co, 2002.
13. T. Nakaguchi, K. Jin'no, and M. Tanaka, "Theoretical Analysis of Hysteresis Neural Network Solving N-Queens Problems," presented at Proc. of IEEE/ISCAS'99, Orlando, Florida, 1999.
14. T. Nakaguchi, K. Jin'no, and M. Tanaka, "Hardware combinatorial optimization problems solver by hysteresis neural networks," presented at The 2001 IEEE International Symposium on Circuits and Systems, 2001 (ISCAS 2001), Sydney, Australia, 2001.
15. Ö. Johansson, "Simple distributed A+1-coloring of graphs " Information Processing Letters, vol. 70, pp. 229-232, 1999.
16. M. Luby, "A simple parallel algorithm for the maximal independent set problem," SIAM Journal on Computing vol. 15, pp. 1036-1055, 1986.
17. M. Kubale and L. Kuszner, "A Better Practical Algorithm for Distributed Graph Coloring " presented at Proceedings of the International Conference on Parallel Computing in Electrical Engineering, 2002.
18. D. A. Grable and A. Panconesi, "Fast distributed algorithms for Brooks-Vizing colorings," Journal of Algorithms, vol. 37, pp. 85-120, 2000.
19. N. Linial, "Locality in distributed graph algorithms," SIAM Journal on Computing, vol. 20, pp. 193-201, 1992.
20. G. De Marco and A. Pelc, "Fast distributed graph coloring with O(A) colors " presented at Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms Washington, D.C., United States 2001.
21. I. Finocchi, A. Panconesi, and R. Silvestri, "Experimental analysis of simple, distributed vertex coloring algorithms " in Proceedings of the thirteenth annual ACM- SIAM symposium on Discrete algorithms. San Francisco, California: Society for Industrial and Applied Mathematics, 2002.
22. DIMACS, "DIMACS implementation challenges: NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability," vol. 2007: http://mat.gsia.cmu.edu/COLOR/instances.html, 1993.
23. S. Camazine, J.-L. Deneubourg, N. R. Franks, J. Sneyd, G. Theraulaz, and E. Bonabeau, Self-synchronization in biological systems. Princeton, New Jersey: Princeton University Press, 2001.
24. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Shevon, "Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning," Operations research, vol. 39, pp. 378-406, 1991.
25. O. Coudert, "Exact coloring of real-graphs is easy," presented at Annual ACM IEEE Design Automation Conference, Anaheim, California, 1997.
26. I. Dukanovic and F. Rendl, "A semidefinite programming based heuristic for graph coloring," Discrete applied mathematics, vol. doi: 10.1016/j.dam.2006.07.014, 2007.
27. I. Blöchliger and N. Zufferey, "A graph coloring heuristic using partial solutions and a reactive tabu scheme," Computers and Operations Research vol. 35, pp. 960-975, 2008.
28. F. T. Leighton, "A graph coloring for large scheduling problems," Journal of Research of the National Bureau of Standards, vol. 84, pp. 489-503, 1979.