Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

DOI10.1007/BF02835831zbMath0814.90123MaRDI QIDQ4000864

Siu-Wing Cheng, Ravi Janardan

Publication date: 26 September 1992

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

routingdistributed algorithmshortest-path treedistributed single-source shortest-path algorithmouterplanar decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A new distributed depth-first-search algorithm
• Designing networks with compact routing tables
• Complexity of network synchronization
• A new distributed algorithm to find breadth first search trees
• On the Complexity of Covering Vertices by Faces in a Planar Graph
• Space-efficient and fault-tolerant message routing in outerplanar networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient distributed algorithms for single-source shortest paths and related problems on plane networks