A TIME-OPTIMAL MESSAGE-EFFICIENT DISTRIBUTED ALGORITHM FOR DEPTH-1ST-SEARCH

被引：24

作者：

LAKSHMANAN, KB

MEENAKSHI, N

THULASIRAMAN, K

机构：

[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,MADRAS 600036,TAMIL NADU,INDIA

[2] CONCORDIA UNIV,DEPT ELECT ENGN,MONTREAL H3G 1M8,QUEBEC,CANADA

来源：

关键词：

D O I：

10.1016/0020-0190(87)90228-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：103 / 109

页数：7

共 6 条

[1] A NEW DISTRIBUTED DEPTH-1ST-SEARCH ALGORITHM [J].

AWERBUCH, B .

[2] ECHO ALGORITHMS - DEPTH PARALLEL OPERATIONS ON GENERAL GRAPHS [J].

CHANG, EJH .

[3]

CHEUNG TY, 1983, IEEE T SOFTWARE ENG, V9, P504, DOI 10.1109/TSE.1983.234958

[4]

Even S., 1979, GRAPH ALGORITHMS

[5] DISTRIBUTED NETWORK PROTOCOLS [J].

SEGALL, A .

[6]

Swamy MNS, 1981, GRAPHS NETWORKS ALGO