中国物理B ›› 2013, Vol. 22 ›› Issue (6): 60507-060507.doi: 10.1088/1674-1056/22/6/060507

• GENERAL • 上一篇    下一篇

Network evolution driven by dynamics applied to graph coloring

吴建设a, 李力光a, 王晓华b, 于昕a, 焦李成a   

  1. a Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, 224# Xidian University,2# Taibai South Road, Xi'an 710071, China;
    b Aeronautical Computing Technique Research Institute, Xi'an 710068, China
  • 收稿日期:2012-08-31 修回日期:2012-10-22 出版日期:2013-05-01 发布日期:2013-05-01
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grants Nos. 61072139, 61072106, 61203303, 61003198, 61272279, and 61003199).

Network evolution driven by dynamics applied to graph coloring

Wu Jian-She (吴建设)a, Li Li-Guang (李力光)a, Wang Xiao-Hua (王晓华)b, Yu Xin (于昕)a, Jiao Li-Cheng (焦李成)a   

  1. a Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, 224# Xidian University,2# Taibai South Road, Xi'an 710071, China;
    b Aeronautical Computing Technique Research Institute, Xi'an 710068, China
  • Received:2012-08-31 Revised:2012-10-22 Online:2013-05-01 Published:2013-05-01
  • Contact: Wu Jian-She E-mail:jianshewu@126.com
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grants Nos. 61072139, 61072106, 61203303, 61003198, 61272279, and 61003199).

摘要: 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 coevolutionary 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 coevolution 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

Abstract: 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 coevolutionary 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 coevolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring.

Key words: network dynamics, evolution of network, evolutionary strategies, graph coloring problem

中图分类号:  (Nonlinear dynamics and chaos)

  • 05.45.-a
02.10.Ox (Combinatorics; graph theory) 02.50.-r (Probability theory, stochastic processes, and statistics)