A SIMPLE PARALLEL ALGORITHM FOR THE MAXIMAL INDEPENDENT SET PROBLEM

被引：612

作者：

LUBY, M

机构：

[1] Univ of Toronto, Toronto, Ont, Can, Univ of Toronto, Toronto, Ont, Can

来源：

关键词：

D O I：

10.1137/0215074

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1036 / 1053

页数：18

共 40 条

[1]

ALEXI W, 1984, 25TH P IEEE S F COMP

[2]

ALEXI W, UNPUB SIAM J COMPUTI

[3]

Alon N., COMMUNICATION

[4]

Anderson Roy, COMMUNICATION

[5] On colouring the nodes of a network [J].

Brooks, RL .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197

[6]

CARTER JL, 1979, J COMPUT SYST SCI, V18, P143, DOI 10.1016/0022-0000(79)90044-8

[7]

CHOR B, POWER 2 POINTS BASED

[8]

CHOR B, UNPUB 26TH P IEEE S

[9] ON THE APPLICATION OF THE BOREL-CANTELLI LEMMA [J].

CHUNG, KL ;

ERDOS, P .

[10]

COOK S, 1985, INFORMATION CONTROL, V64