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 条

[21] PLANAR GRAPH-COLORING WITH AN UNCOOPERATIVE PARTNER
KIERSTEAD, HA
TROTTER, WT
JOURNAL OF GRAPH THEORY, 1994, 18 (06) : 569 - 584
[22] A RANDOMIZED HEURISTIC ALGORITHM FOR GRAPH-COLORING
ZEROVNIK, J
GRAPH THEORY, 1989, : 137 - 147
[23] NUMERICAL EXPERIENCES WITH GRAPH-COLORING ALGORITHMS
PEEMOLLER, J
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 24 (01) : 146 - 151
[24] GRAPH-COLORING USING EIGENVALUE DECOMPOSITION
ASPVALL, B
GILBERT, JR
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (04): : 526 - 538
[25] BACKTRACK - AN O(1) EXPECTED TIME ALGORITHM FOR THE GRAPH-COLORING PROBLEM
WILF, HS
INFORMATION PROCESSING LETTERS, 1984, 18 (03) : 119 - 121
[26] PROBABILISTIC ANALYSIS OF GRAPH-COLORING ALGORITHMS
MARCHETTISPACCAMELA, A
TALAMO, M
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 159 : 332 - 340
[27] OPTIMAL APPROXIMATION OF SPARSE HESSIANS AND ITS EQUIVALENCE TO A GRAPH-COLORING PROBLEM
MCCORMICK, ST
MATHEMATICAL PROGRAMMING, 1983, 26 (02) : 153 - 171
[28] GRAPH-COLORING BOUNDS FOR CELLULAR RADIO
BALDI, P
POSNER, EC
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1990, 19 (10) : 91 - 97
[29] HEURISTIC ALGORITHM OF GENERALIZED GRAPH-COLORING
DIDMANIDZE, IS
DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1989, (03): : 63 - 66
[30] IMPROVEMENTS TO GRAPH-COLORING REGISTER ALLOCATION
BRIGGS, P
COOPER, KD
TORCZON, L
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 428 - 455

← 1 2 3 4 5 →