A distributed shortest path algorithm for a planar network

DOI10.1016/0890-5401(90)90051-IzbMath0705.68058MaRDI QIDQ918205

Greg N. Frederickson

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

shortest pathplanar networkDistributed algorithmsdistributed computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Intelligent transportation systems -- Enabling technologies ⋮ Computation of shortest path in cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A new distributed algorithm to find breadth first search trees
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Efficient Algorithms for Shortest Paths in Sparse Networks

This page was built for publication: A distributed shortest path algorithm for a planar network