Distributed Algorithms For Unidirectional Networks

DOI10.1137/S009753979223277XMaRDI QIDQ4327415zbMATH OpenOpenAlexFDO

Authors 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

distributively computingtraversal algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4058838
• scientific article; zbMATH DE number 4058884
• Self-stabilization with r-Operators Revisited
• Publication:4206383
• scientific article; zbMATH DE number 4026814

Cited in

(18)

• Distributed algorithms in synchronous broadcasting networks
• Stabilizing time-adaptive protocols
• On a game in directed graphs.
• Exploration of dynamic networks: tight bounds on the number of agents
• Robustness of the rotor-router mechanism
• Map construction of unknown graphs by multiple agents
• Improved approximation for orienting mixed graphs
• The bit complexity of the predecessor problem
• UniLoG — Ein System zur verteilten Lastgenerierung in Netzen
• scientific article; zbMATH DE number 6005911 (Why is no real title available?)
• OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
• scientific article; zbMATH DE number 4050991 (Why is no real title available?)
• scientific article; zbMATH DE number 4058838 (Why is no real title available?)
• Computing with Snakes in Directed Networks of Automata
• Path-driven orientation of mixed graphs
• The wake up and report problem is time-equivalent to the firing squad synchronization problem
• On the complexity of global computation in the presence of link failures: the case of uni-directional faults
• Setting port numbers for fast graph exploration

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

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