An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components

DOI10.1007/S006070050013zbMath0926.68053OpenAlexW2143340273MaRDI QIDQ1293460

P. Pal Chaudhuri

Publication date: 5 October 1999

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

self-stabilizing algorithmnetwork model of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (3)

SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity ⋮ A self-stabilizing graph algorithm: Finding the cutting center of a tree

This page was built for publication: An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components