Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Generating textures on arbitrary surfaces using reaction-diffusion
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
New methods to color the vertices of a graph
Communications of the ACM
Ant colony optimization theory: a survey
Theoretical Computer Science
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
Constructive generation of very hard 3-colorability instances
Discrete Applied Mathematics
| Hi-index | 0.00 |
We have proposed the mapping of graph coloring problems into swarm dynamics. Empirical evidence that flock steering behaviors augmented with the notion of hostility (enmity and friendliness) are enough to perform efficiently the task of coloring the nodes of graphs even in the case 3-coloration hard graph topologies. We discuss here what are the minimal cognitive capabilities that allow the emergent behavior of swarms to solve such NP-complete problem without mediating an explicit knowledge representation.