Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs
- 29 February 2012
- journal article
- research article
- Published by Springer Nature in Swarm Intelligence
- Vol. 6 (2) , 117-150
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- On the complexity of distributed graph coloring with local minimality constraintsNetworks, 2009
- Coloring unstructured radio networksDistributed Computing, 2008
- Variable space search for graph coloringDiscrete Applied Mathematics, 2008
- Mathematical modeling of frogs’ calling behavior and its possible application to artificial life and roboticsArtificial Life and Robotics, 2008
- A new look at survey propagation and its generalizationsJournal of the ACM, 2007
- Swarm intelligenceScholarpedia, 2007
- Topology control in wireless ad hoc and sensor networksACM Computing Surveys, 2005
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networksArtificial Intelligence, 2005
- An Experimental Analysis of Simple, Distributed Vertex Coloring AlgorithmsAlgorithmica, 2004
- The social behaviour of anuran amphibiansAnimal Behaviour, 1977