Ants and graph coloring

被引：0
|
作者：
Shawe-Taylor, J [1 ]
Zerovnik, J [1 ]
机构：
[1] Univ London Royal Holloway & Bedford New Coll, Dept Comp Sci, Egham TW20 0EX, Surrey, England
来源：
ARTIFICIAL NEURAL NETS AND GENETIC ALGORITHMS | 2001年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Ants algorithm is an evolutionary search method for solving combinatorial optimization problems. In this note we propose a version of the algorithm for coloring a graph with a fixed number of colors.
引用
收藏
页码：276 / 279
页数：4
相关论文
共 50 条
  • [1] A Cooperative Approach Using Ants and Bees for the Graph Coloring Problem
    Bessedik, Malika
    Daoudi, Asma
    Benatchba, Karima
    NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION (NICSO 2013), 2014, 512 : 179 - 190
  • [2] The coloring ideal and coloring complex of a graph
    Steingrímsson, E
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2001, 14 (01) : 73 - 84
  • [3] The Coloring Ideal and Coloring Complex of a Graph
    Einar Steingrímsson
    Journal of Algebraic Combinatorics, 2001, 14 : 73 - 84
  • [4] Graph coloring algorithms
    Zhou, Xiao
    Nishizeki, Takao
    IEICE Transactions on Information and Systems, 2000, E83-D (03) : 407 - 417
  • [5] COLORING EDGES OF A GRAPH
    SCHWENK, AJ
    AMERICAN MATHEMATICAL MONTHLY, 1977, 84 (03): : 224 - 224
  • [6] Relaxed coloring of a graph
    Deuber, W
    Zhu, XD
    GRAPHS AND COMBINATORICS, 1998, 14 (02) : 121 - 130
  • [7] Graph coloring with webMathematica
    Ufuktepe, Ü
    Bacak, G
    Beseri, T
    COMPUTATIONAL SCIENCE - ICCS 2004, PROCEEDINGS, 2004, 3039 : 376 - 381
  • [8] Nonrepetitive graph coloring
    Grytczuk, Jaroslaw
    Graph Theory in Paris: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 209 - 218
  • [9] Graph coloring and conditional graph entropy
    Doshi, Vishal
    Shah, Devavrat
    Medard, Muriel
    Jaggi, Sidharth
    2006 FORTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-5, 2006, : 2137 - +
  • [10] ROLE COLORING A GRAPH
    EVERETT, MG
    BORGATTI, S
    MATHEMATICAL SOCIAL SCIENCES, 1991, 21 (02) : 183 - 188
12345