✦ LIBER ✦

A 'String Algorithm' for Shortest Path in Directed Networks

✍ Scribed by Victor Klee

Book ID: 123685089
Publisher: INFORMS
Year: 1964
Tongue: English
Weight: 238 KB
Volume: 12
Category: Article
ISSN: 0030-364X
DOI: 10.2307/168122

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Decomposition Algorithm for Shortest P

A Decomposition Algorithm for Shortest Paths in a Network

✍ T. C. Hu 📂 Article 📅 1968 🏛 INFORMS 🌐 English ⚖ 466 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

Shortest viable path algorithm in multim

Shortest viable path algorithm in multimodal networks

✍ Angelica Lozano; Giovanni Storchi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Shortest path algorithms for nearly acyc

Shortest path algorithms for nearly acyclic directed graphs

✍ Tadao Takaoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m + n log t) computing time, where m and n are the numbers of edges and vertices of the given directed graph and t is the number of delete-min operations in the priority qu

A k shortest path algorithm for adaptive

A k shortest path algorithm for adaptive routing in communications networks

✍ Topkis, D.M. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 708 KB

A loop-free shortest-path routing algori

A loop-free shortest-path routing algorithm for dynamic networks

✍ DʼAngelo, Gianlorenzo; DʼEmidio, Mattia; Frigioni, Daniele 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 598 KB