Presents a non-composite self-stabilizing algorithm for 2-edge and 2-vertex connectivity in asynchronous networks with O(dnΔ) round and O(n log Δ) bit complexities matching its underlying DFS.
A silent self-stabilizing algorithm for fin ding cut-nodes and bridges
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network
Presents a non-composite self-stabilizing algorithm for 2-edge and 2-vertex connectivity in asynchronous networks with O(dnΔ) round and O(n log Δ) bit complexities matching its underlying DFS.