SEQUENTIAL AND DISTRIBUTED GRAPH-COLORING ALGORITHMS WITH PERFORMANCE ANALYSIS IN RANDOM GRAPH SPACES

被引：17

作者：

SHAMIR, E ^{[1
]}

UPFAL, E ^{[1
]}

机构：

[1] HEBREW UNIV JERUSALEM,INST MATH & COMP SCI,DEPT COMP SCI,JERUSALEM,ISRAEL

来源：

关键词：

D O I：

10.1016/0196-6774(84)90003-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：488 / 501

页数：14

共 9 条

ANGLUIN, D ;

VALIANT, LG .

[2]

ANGLUIN D, 1980, 12TH ACM STOC P, P62

[3]

BOLLOBAS B, 1976, MATH PROC CAMBRIDGE, V80, P419, DOI 10.1017/S0305004100053056

[4]

Bollobas B., 1979, Graph Theory: An Introductory Course

[5]

ERDOS P, 1960, B INT STATIST INST, V38, P343

[6]

Erdos Paul, 1974, Probabilistic Methods in Combinatorics

[7]

GRIMMET CR, 1975, MATH P CAMBRIDGE PHI, V77, P313

[8]

SCHMIDTPRUZAN J, UNPUB COMBINATORICA

[9]

SCHMIDTPRUZAN J, UNPUB J GRAPH TH