HOW TO FIND BICONNECTED COMPONENTS IN DISTRIBUTED NETWORKS

被引：26
|
作者：
HOHBERG, W
机构：
[1] Institut für Theoretische Informatik, Technische Hochschule Darmstadt, D-6100 Darmstadt
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1990年 / 9卷 / 04期
关键词：
D O I：
10.1016/0743-7315(90)90122-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
To find biconnected components in a distributed network with n processors and m edges a message complexity of Ω(m + n log n) is necessary. This holds for asynchronous systems, for systems with local information, and for time bounded synchronous systems. We present algorithms which match the lower bound. © 1990.
引用
收藏
页码：374 / 386
页数：13
相关论文
共 50 条
12345