✦ LIBER ✦

Errata: Revised Matrix Algorithms for Shortest Paths

✍ Scribed by Hu, T. C.

Book ID: 118193959
Publisher: Society for Industrial and Applied Mathematics
Year: 1967
Tongue: English
Weight: 30 KB
Volume: 15
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0115134

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Algorithms for Dynamic Shortest

Improved Algorithms for Dynamic Shortest Paths

✍ H. N. Djidjev; G. E. Pantziou; C. D. Zaroliagis 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 128 KB

Applications of shortest path algorithms

Applications of shortest path algorithms to matrix scalings

✍ M. v. Golitschek; H. Schneider 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 646 KB

Approximation Algorithms for Curvature-C

Approximation Algorithms for Curvature-Constrained Shortest Paths

✍ Agarwal, Pankaj K.; Wang, Hongyan 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 376 KB

Efficient Algorithms for Shortest Paths

Efficient Algorithms for Shortest Paths in Sparse Networks

✍ Johnson, Donald B. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 833 KB

Dynamic algorithms for shortest paths in

Dynamic algorithms for shortest paths in planar graphs

✍ Esteban Feuerstein; Alberto Marchetti-Spaccamela 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 887 KB

Implementation of algorithms for K short

Implementation of algorithms for K shortest loopless paths

✍ Aarni Perko 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 641 KB

Implementations of loopless k shortest path algorithms are examined. Efficient storage structures for a large number of paths are given. A fast algorithm for determining the shortest paths in Yen's method is developed. Timing experiments show that a hybrid of Clarke's and Yen's methods is generally