✦ LIBER ✦

An algorithm for the ranking of shortest paths

✍ Scribed by JoséAugusto Azevedo; Maria Emília O. Santos Costa; Joaquim João E.R. Silvestre Madeira; Ernesto Q. Vieira Martins

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 631 KB
Volume: 69
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90095-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A computational improvement for a shorte

A computational improvement for a shortest paths ranking algorithm

✍ JoséAugusto de Azevedo; Joaquim João E.R. Silvestre Madeira; Ernesto Q. Vieira M 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 257 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 incremental algorithm for identificat

An incremental algorithm for identification of longest (shortest) paths

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

An algorithm for the resource constraine

An algorithm for the resource constrained shortest path problem

✍ J. E. Beasley; N. Christofides 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 812 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

An algorithm for ranking paths that may

An algorithm for ranking paths that may contain cycles

✍ Ernesto de Queirós Vieira Martins 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 585 KB