scientific article; zbMATH DE number 4215341

MaRDI QIDQ3361867zbMATH OpenFDO

Authors Yahui Zhu, Mohan L. Ahuja

Publication date 1989

zbMATH Keywords

asynchronous networksdistributed depth first search

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• An efficient distributed bridge-finding algorithm
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY
• Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
• An Efficient Parallel Biconnectivity Algorithm

Cited in

(4)

• An efficient distributed bridge-finding algorithm
• Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
• scientific article; zbMATH DE number 1542851 (Why is no real title available?)
• An efficient distributed algorithm for finding all hinge vertices in networks

This page was built for publication:

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