An optimal distributed algorithm for recognizing mesh-connected networks

DOI10.1016/0304-3975(93)90291-ZzbMath0801.68070OpenAlexW2095700848MaRDI QIDQ1314373

Sridhar Radhakrishnan, Rajanarayanan Subbiah, S. Sitharama Iyengar, Rangasami L. Kashyap

Publication date: 29 November 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90291-z

zbMATH Keywords

distributed algorithmmessage complexitymesh-connected networksnetwork recognition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Complexity of distributed commit protocols
• Distributed algorithms for finding centers and medians in networks
• Complexity of network synchronization
• A Distributed Graph Algorithm: Knot Detection
• Distributed computation on graphs
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• On finding and updating shortest paths distributively

This page was built for publication: An optimal distributed algorithm for recognizing mesh-connected networks