Simulated annealing and graph colouring

被引：6

作者：

Nolte, A ^{[1
]}

Schrader, R ^{[1
]}

机构：

[1] Univ Cologne, D-50931 Cologne, Germany

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2001年 / 10卷 / 01期

关键词：

D O I：

10.1017/S0963548300004557

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Simulated annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of simulated annealing to the 3-colouring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected first hitting time of a proper colouring, given an arbitrary cooling scheme, is of exponential size. These results are complementary to those in [13], where we prove the convergence of simulated annealing to an optimal solution in exponential time.

引用

页码：29 / 40

页数：12

共 50 条

[1] GRAPH IDENTIFICATION BY SIMULATED ANNEALING
MIKHAILOV, AS
[J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1988, 21 (09): : L487 - L490
[2] Comparative Performance of Modified Simulated Annealing with Simple Simulated Annealing for Graph Coloring Problem
Pal, Anindya Jyoti
Ray, Biman
Zakaria, Nordin
Sen Sarma, Samar
[J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2012, 2012, 9 : 321 - 327
[3] Simulated annealing algorithm for detecting graph isomorphism
Geng Xiutang
Zhang Kai
[J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2008, 19 (05) : 1047 - 1052
[4] Simulated annealing algorithm for detecting graph isomorphism
Geng Xiutang & Zhang Kai Dept. of Control Science and Engineering
[J]. Journal of Systems Engineering and Electronics, 2008, (05) : 1047 - 1052
[5] REMARKS ON ERGODICITY OF SIMULATED ANNEALING ALGORITHMS ON A GRAPH
MICLO, L
[J]. STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1995, 58 (02) : 329 - 360
[6] A simulated annealing algorithm for determining the thickness of a graph
Poranen, T
[J]. INFORMATION SCIENCES, 2005, 172 (1-2) : 155 - 172
[7] Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity
Sugie, Yuya
Yoshida, Yuki
Mertig, Normann
Takemoto, Takashi
Teramoto, Hiroshi
Nakamura, Atsuyoshi
Takigawa, Ichigaku
Minato, Shin-Ichi
Yamaoka, Masanao
Komatsuzaki, Tamiki
[J]. THEORY AND PRACTICE OF NATURAL COMPUTING (TPNC 2018), 2018, 11324 : 111 - 123
[8] Improved Graph Edit Distance Approximation with Simulated Annealing
Riesen, Kaspar
Fischer, Andreas
Bunke, Horst
[J]. GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION (GBRPR 2017), 2017, 10310 : 222 - 231
[9] Parallel Simulated Annealing algorithm for Graph Coloring Problem
Lukasik, Szymon
Kokosinski, Zbigniew
Swieton, Grzegorz
[J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 229 - +
[10] 3D graph drawing with simulated annealing
Cruz, IF
Twarog, JP
[J]. GRAPH DRAWING, 1996, 1027 : 162 - 165

← 1 2 3 4 5 →