ULTRAMETRICITY TRANSITION IN THE GRAPH-COLORING PROBLEM

被引：11

|

作者：

BOUCHAUD, JP ^{[1
]}

LEDOUSSAL, P ^{[1
]}

机构：

[1] UNIV PARIS SUD,ECOLE NORMALE SUPER,PHYS THEOR LAB,F-75231 PARIS 05,FRANCE

来源：

EUROPHYSICS LETTERS | 1986年 / 1卷 / 03期

关键词：

D O I：

10.1209/0295-5075/1/3/001

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

引用

收藏

页码：91 / 98

页数：8

相关论文

共 50 条

[31] PARALLEL AND ONLINE GRAPH-COLORING ALGORITHMS
HALLDORSSON, MM
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 61 - 70
[32] IMPROVEMENTS TO GRAPH-COLORING REGISTER ALLOCATION
BRIGGS, P
COOPER, KD
TORCZON, L
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 428 - 455
[33] A LAS VEGAS GRAPH-COLORING ALGORITHM
ELLIS, JA
LEPOLESA, PM
COMPUTER JOURNAL, 1989, 32 (05): : 474 - 476
[34] LOWER BOUNDS FOR ONLINE GRAPH-COLORING
HALLDORSSON, MM
SZEGEDY, M
THEORETICAL COMPUTER SCIENCE, 1994, 130 (01) : 163 - 174
[35] LOAD BALANCING BY GRAPH-COLORING, AN ALGORITHM
JEURISSEN, R
LAYTON, W
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1994, 27 (03) : 27 - 32
[36] THE COMPLEXITY OF SOME GRAPH-COLORING PROBLEMS
EDWARDS, K
DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 131 - 140
[37] SOME SEQUENTIAL GRAPH-COLORING ALGORITHMS
SENSARMA, S
BANDYOPADHYAY, SK
INTERNATIONAL JOURNAL OF ELECTRONICS, 1989, 67 (02) : 187 - 199
[38] NEW APPROXIMATION ALGORITHMS FOR GRAPH-COLORING
BLUM, A
JOURNAL OF THE ACM, 1994, 41 (03) : 470 - 516
[39] BROOKS GRAPH-COLORING THEOREM AND THE INDEPENDENCE NUMBER
CATLIN, PA
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (01) : 42 - 48
[40] IMPROVING THE PERFORMANCE GUARANTEE FOR APPROXIMATE GRAPH-COLORING
WIGDERSON, A
JOURNAL OF THE ACM, 1983, 30 (04) : 729 - 735

← 1 2 3 4 5 →