Distributed Algorithms For Unidirectional Networks

DOI10.1137/S009753979223277XzbMath0834.68039OpenAlexW2009486458MaRDI QIDQ4327415

Yehuda Afek, Eli Gafni

Publication date: 6 April 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979223277x

zbMATH Keywords

traversal algorithmsdistributively computing

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (11)

The bit complexity of the predecessor problem ⋮ OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT ⋮ Robustness of the rotor-router mechanism ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ Path-driven orientation of mixed graphs ⋮ Map construction of unknown graphs by multiple agents ⋮ Setting port numbers for fast graph exploration ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Stabilizing time-adaptive protocols ⋮ On a game in directed graphs. ⋮ Improved approximation for orienting mixed graphs

This page was built for publication: Distributed Algorithms For Unidirectional Networks