A single source shortest path algorithm for a planar distributed network

Authors:
G N Frederickson
Affiliations:
-
Venue:
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Year:
1985

Citing 0
Cited 3

Randomized distributed shortest paths algorithms

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Shortest paths and loop-free routing in dynamic networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Computing almost shortest paths

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.01

Visualization

Abstract