An incremental distributed algorithm for computing biconnected components in dynamic graphs

DOI10.1007/PL00009226zbMath0915.68131OpenAlexW2039870507MaRDI QIDQ1273936

B. Swaminathan, Kenneth J. Goldman

Publication date: 6 January 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009226

zbMATH Keywords

distributed algorithmbiconnected component

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY