✦ LIBER ✦

An O(mlog logD) algorithm for shortest paths

✍ Scribed by Rolf G. Karlsson; Patricio V. Poblete

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 178 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90104-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(tm log D) Algorithm for shortest pa

An O(tm log D) Algorithm for shortest paths

✍ Pierre Hansen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 348 KB

An algorithm for the ranking of shortest

An algorithm for the ranking of shortest paths

✍ JoséAugusto Azevedo; Maria Emília O. Santos Costa; Joaquim João E.R. Silvestre M 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An efficient algorithm for K shortest si

An efficient algorithm for K shortest simple paths

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

An Optimal-Time Algorithm for Shortest P

An Optimal-Time Algorithm for Shortest Paths on

✍ Yevgeny Schreiber 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 917 KB

An incremental algorithm for identificat

An incremental algorithm for identification of longest (shortest) paths

✍ Sandip Kundu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

An efficient implementation of an algori

An efficient implementation of an algorithm for findingK shortest simple paths

✍ Hadjiconstantinou, E.; Christofides, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho