Network evolution driven by dynamics applied to graph coloring
An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weig...
Saved in:
| Published in | Chinese physics B Vol. 22; no. 6; pp. 262 - 267 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
01.06.2013
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1674-1056 2058-3834 1741-4199 |
| DOI | 10.1088/1674-1056/22/6/060507 |
Cover
| Summary: | An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring. |
|---|---|
| Bibliography: | An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring. network dynamics, evolution of network, evolutionary strategies, graph coloring problem 11-5639/O4 ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 1674-1056 2058-3834 1741-4199 |
| DOI: | 10.1088/1674-1056/22/6/060507 |