A RANDOMIZED 3-COLORING ALGORITHM

被引：41

作者：

PETFORD, AD ^{[1
]}

WELSH, DJA ^{[1
]}

机构：

[1] UNIV OXFORD, INST MATH, OXFORD, ENGLAND

来源：

关键词：

D O I：

10.1016/0012-365X(89)90214-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：253 / 261

页数：9

共 12 条

[1]

BONDY JA, 1976, GRAPH THEORY APPLICA

[2] FINITE PARTICLE-SYSTEMS AND INFECTION MODELS [J].

DONNELLY, P ;

WELSH, D .

[3]

DONNELLY PJ, 1984, ANTIVOTER PROBLEM, P133

[4] THE COMPLEXITY OF COLORING PROBLEMS ON DENSE GRAPHS [J].

EDWARDS, K .

[5]

FARR G, 1985, COMMUNICATION

[6]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[7]

Garey M. R., 1979, COMPUTERS INTRACTABI

[8] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

[9]

KUCERA L, 1977, LECTURE NOTES COMPUT, V56, P477

[10]

WELSH D, 1984, SPINGER LECUTE NOTE, V1212, P300