An incremental distributed algorithm for computing biconnected components in dynamic graphs

DOI10.1007/PL00009226MaRDI QIDQ1273936zbMATH OpenOpenAlexFDO

Authors 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

biconnected componentdistributed algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1256640
• A stabilizing algorithm for finding biconnected components
• Fully dynamic biconnectivity in graphs

Cited in

(1)

• AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

This page was built for publication: An incremental distributed algorithm for computing biconnected components in dynamic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273936)