Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons

Authors:
Jin Y. Yen
Affiliations:
University of Santa Clara, Graduate School of Business, Santa Clara, CA
Venue:
Journal of the ACM (JACM)
Year:
1972

Citing 0
Cited 8

A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks

Journal of the ACM (JACM)
Reply to Williams and White's Note

Journal of the ACM (JACM)
A Shortest Path Algorithm for Edge-Sparse Graphs

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
The channel expansion problem in layout design

DAC '84 Proceedings of the 21st Design Automation Conference
A shortest-path algorithm with expected time O(n2 log n log* n)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Map matching and uncertainty: an algorithm and real-world experiments

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Flexible secure inter-domain interoperability through attribute conversion

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract