DISTRIBUTED ALGORITHMS FOR FINDING CENTERS AND MEDIANS IN NETWORKS

被引：46

作者：

KORACH, E

ROTEM, D

SANTORO, N

机构：

[1] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA

[2] CARLETON UNIV,SCH COMP SCI,OTTAWA K1S 5B6,ONTARIO,CANADA

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1984年 / 6卷 / 03期

关键词：

D O I：

10.1145/579.585

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：380 / 401

页数：22

共 20 条

[1]

ABRAM JM, 1978, 16TH P ANN ALL C COM, P271

[2]

ANGLUIN D, 1980, 12TH P ANN ACM S THE, P82

[3]

BONDY JA, 1976, GRAPH THEORY APPLICA

[4]

BURNS JE, 1980, 91 IND U COMP SCI DE

[5]

CHANG EJ, 1979, CCRG103 U TOR COMP S

[6] THE BYZANTINE GENERALS STRIKE AGAIN [J].

DOLEV, D .

JOURNAL OF ALGORITHMS, 1982, 3 (01) :14-30

[7] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].

GALLAGER, RG ;

HUMBLET, PA ;

SPIRA, PM .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77

[8]

HIRSCHBERG DS, 1980, 18TH P ALL C COMM CO, P823

[9]

LYNCH NA, 1980, GITICS7903 GEORG I T

[10] A DISTRIBUTED GRAPH ALGORITHM - KNOT DETECTION [J].

MISRA, J ;

CHANDY, KM .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (04) :678-686

← 1 2 →