A distributed shortest path algorithm for a planar network
Author:
- Greg N. FredericksonGFGreg N. Frederickson
- 1 June 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 86 (2) , 140-159
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- A new distributed algorithm to find breadth first search treesIEEE Transactions on Information Theory, 1987
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A note on two problems in connexion with graphsNumerische Mathematik, 1959