A Single Source Shortest Path Algorithm for a Planar Distributed Network

Authors:
Greg N. Frederickson
Affiliations:
-
Venue:
STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
Year:
1985

Citing 0
Cited 4

An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights

IEEE Transactions on Software Engineering
Distributed Algorithms for Network Recognition Problems

IEEE Transactions on Computers
Computing almost shortest paths

ACM Transactions on Algorithms (TALG)
Efficient distributed breadth-first search algorithm

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract