A dynamic self-stabilizing algorithm for constructing a transport net

DOI10.1007/S00607-001-1436-7zbMath1002.68014OpenAlexW1515924326MaRDI QIDQ1599817

Pranay Chaudhuri, Mehmet Hakan Karaata

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

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

Related Items (4)

A self-stabilizing algorithm for the st-order problem ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ 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

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