A dynamic self-stabilizing algorithm for constructing a transport net

DOI10.1007/S00607-001-1436-7MaRDI QIDQ1599817zbMATH OpenOpenAlexFDO

Authors Mehmet Hakan Karaata, Pranay Chaudhuri

Publication date 6 June 2002

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-001-1436-7

zbMATH Keywords

undirected biconnected graph

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• A stabilizing algorithm for finding biconnected components
• A self-stabilizing algorithm for bridge finding
• A self-stabilizing algorithm for finding articulation points
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• Self-stabilization with \(r\)-operators

Cited in

(12)

• A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets
• An optimal self-stabilizing strarvation-free alternator
• A self-stabilizing algorithm for the st-order problem
• A self-stabilizing and local Delaunay graph construction
• A self-stabilizing algorithm for the maximum flow problem
• A self-stabilizing algorithm for bridge finding
• A self-stabilizing algorithm for finding articulation points
• Self stabilization in distributed knot detection
• Distributed Computing – IWDC 2005
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
• A stabilizing algorithm for finding biconnected components
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs

This page was built for publication: A dynamic self-stabilizing algorithm for constructing a transport net

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