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 条
  • [41] STABILITY OF ELECTRICAL NETWORKS CONTAINING DISTRIBUTED RC COMPONENTS
    PRADA, G
    BICKART, TA
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1971, 33 (02) : 367 - &
  • [42] On the parallel computation of the biconnected and strongly connected co-components of graphs
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (14) : 1858 - 1877
  • [43] Smashing peacocks further: Drawing quasi-trees from biconnected components
    Archambault, Daniel
    Munzner, Tamara
    Auber, David
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2006, 12 (05) : 813 - 820
  • [44] How To Generate Distributed Software Components From Centralized Ones?
    Seriai, Abdelhak
    Bastide, Gautier
    Oussalah, Mourad
    JOURNAL OF COMPUTERS, 2006, 1 (05) : 40 - 52
  • [45] Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components (Extended Abstract)
    Vietz, Duygu
    Hoffmann, Stefan
    Wanke, Egon
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019), 2019, 11355 : 175 - 187
  • [46] GRAPHZEPPELIN: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive)
    Tench, David
    West, Evan
    Zhang, Victor
    Bender, Michael A.
    Chowdhury, Abiyaz
    Delayo, Daniel
    Dellas, J. Ahmed
    Farach-colton, Martin
    Seip, Tyler
    Zhang, Kenny
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2024, 49 (03):
  • [47] A PIECEWISE DECOMPOSITION TECHNIQUE FOR ANALYSIS OF NONLINEAR NETWORKS WITH DISTRIBUTED COMPONENTS
    NAKHIA, MS
    1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 606 - 609
  • [48] Controlling Operation and Timings in Distributed Sensor Networks with Wireless Components
    Furtado, Pedro
    Cecilio, Jose
    PROCEEDINGS 2012 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2012, : 1598 - 1603
  • [49] HOW TO FIND A BATTLESHIP
    FIAT, A
    SHAMIR, A
    NETWORKS, 1989, 19 (03) : 361 - 371
  • [50] HOW TO FIND THE LAW
    Pulling, Arthur C.
    MINNESOTA LAW REVIEW, 1931, 15 (07) : 846 - 846
12345