Can frogs find large independent sets in a decentralized way? Yes they can!

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8667, Issue , 2014, Pages 74-85

  Blum, Christian ^a,b   Blesa, Maria J ^c   Calvo, Borja ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b BASQUE FOUNDATION FOR SCIENCE   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMIMETICS; DISTRIBUTED COMPUTER SYSTEMS; ARTIFICIAL INTELLIGENCE; GRAPH THEORY; SWARM INTELLIGENCE;

BACKBONE FORMATION; FACILITY LOCATIONS; GRAPH COLORINGS; INDEPENDENT SET; NUMBER OF ITERATIONS; SELF SYNCHRONIZATION; SOLUTION QUALITY; SPARSE GRAPHS;

TREES (MATHEMATICS);

EID: 84921713123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-09952-1_7     Document Type: Article

References (11)

1. Online scientific news site ScienceDaily: Frog calls inspire a new algorithm for wireless networks (July 2012), http://www.sciencedaily.com/releases/2012/07/120717100123.htm
2. Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science 331, 183-185 (2011)
3. Bui, M., Butelle, F., Lavault, C: A distributed algorithm for constructing a minimum diameter spanning tree. Journal of Parallel and Distributed Computing 64(5), 571-577 (2004)
4. Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer, London (2013)
5. Erciyes, K., Dagdeviren, O., Cokuslu, D., Yilmaz, O., Gumus, H.: Modeling and Simulation of Mobile Ad hoc Networks, pp. 134-168. CRC Press (2010)
6. Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of AP-completeness. W. H. Freeman (1979)
7. Halldórsson, M.M., Radhakrishnan, J.: Greedy is Good: Appriximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18, 145-163 (1997)
8. Hernandez, H., Blum, C: Distributed graph coloring: An approach based on the calling behavior of Japanese tree frogs. Swarm Intelligence 6(2), 117-150 (2012)
9. Hernandez, H., Blum, C: FrogSim: distributed graph coloring in wireless ad hoc networks — an algorithm inspired by the calling behavior of Japanese tree frogs. Telecommunication Systems (2013)
10. Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. Tech. rep., ArXiv repository (2012), http://arxiv.org/abs/1211.0235
11. Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. In: Fatourou, P., Taubenfeld, G. (eds.) Proceedings of PODC 2013 - ACM Symposium on Principles of Distributed Computing, pp. 147-156. ACM Press (2013)