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 条

[41] A PARALLEL VARIANT OF A HEURISTICAL ALGORITHM FOR GRAPH-COLORING
ZEROVNIK, J
PARALLEL COMPUTING, 1990, 13 (01) : 95 - 100
[42] Probabilistic graph-coloring in bipartite and split graphs
N. Bourgeois
F. Della Croce
B. Escoffier
C. Murat
V. Th. Paschos
Journal of Combinatorial Optimization, 2009, 17 : 274 - 311
[43] REGISTER ALLOCATION VIA HIERARCHICAL GRAPH-COLORING
CALLAHAN, D
KOBLENZ, B
SIGPLAN NOTICES, 1991, 26 (06): : 192 - 203
[44] A BLOW-UP CONSTRUCTION AND GRAPH-COLORING
ALUFFI, P
DISCRETE MATHEMATICS, 1995, 145 (1-3) : 11 - 35
[45] USING TABU SEARCH TECHNIQUES FOR GRAPH-COLORING
HERTZ, A
DEWERRA, D
COMPUTING, 1987, 39 (04) : 345 - 351
[46] HAJOS GRAPH-COLORING CONJECTURE - VARIATIONS AND COUNTEREXAMPLES
CATLIN, PA
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 26 (02) : 268 - 274
[47] GRAPH-COLORING AND MONOTONE-FUNCTIONS ON POSETS
LINIAL, N
DISCRETE MATHEMATICS, 1986, 58 (01) : 97 - 98
[48] A BETTER PERFORMANCE GUARANTEE FOR APPROXIMATE GRAPH-COLORING
BERGER, B
ROMPEL, J
ALGORITHMICA, 1990, 5 (04) : 459 - 466
[49] A GENERALIZED IMPLICIT ENUMERATION ALGORITHM FOR GRAPH-COLORING
KUBALE, M
JACKOWSKI, B
COMMUNICATIONS OF THE ACM, 1985, 28 (04) : 412 - 418
[50] Probabilistic graph-coloring in bipartite and split graphs
Bourgeois, N.
Della Croce, F.
Escoffier, B.
Murat, C.
Paschos, V. Th.
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 17 (03) : 274 - 311

← 1 2 3 4 5 →