Shortest paths in euclidean graphs
- 1 November 1986
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 1 (1-4), 31-48
- https://doi.org/10.1007/bf01840435
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Fibonacci Heaps And Their Uses In Improved Network Optimization AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Oriented Percolation in Two DimensionsThe Annals of Probability, 1984
- Faster methods for random samplingCommunications of the ACM, 1984
- Efficient Implementation Of Graph Algorithms Using ContractionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- Shortest paths with euclidean distances: An explanatory modelNetworks, 1978
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959