✦ LIBER ✦

Computing shortest paths for any number of hops

✍ Scribed by Guerin, R.; Orda, A.

Book ID: 120833263
Publisher: IEEE
Year: 2002
Tongue: English
Weight: 306 KB
Volume: 10
Category: Article
ISSN: 1063-6692
DOI: 10.1109/TNET.2002.803917

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of Shortest Path Routing for La

Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

✍ Sungoh Kwon, ; Shroff, N.B. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 950 KB

Using Selective Path-Doubling for Parall

Using Selective Path-Doubling for Parallel Shortest-Path Computations

✍ Edith Cohen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 291 KB

We 1 consider parallel shortest-paths computations in weighted undirected graphs Ž . < < < < Ž 3 . Gs V, E , where n s V and m s E . The standard O n work path-doubling Ž . Ž . Floyd-Warshall algorithm consists of O log n phases, where in each phase, for Ž . 3 every triplet of vertices u , u , u g V

A neural network for shortest path compu

A neural network for shortest path computation

✍ Araujo, F.; Ribeiro, B.; Rodrigues, L. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 150 KB

On computing sets of shortest paths in a

On computing sets of shortest paths in a graph

✍ Minieka, Edward 📂 Article 📅 1974 🏛 Association for Computing Machinery 🌐 English ⚖ 261 KB

The number of shortest paths in the arra

The number of shortest paths in the arrangement graph

✍ Cheng, Eddie; Grossman, Jerrold W.; Qiu, Ke; Shen, Zhizhang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Computation of the Reverse Shortest-Path

Computation of the Reverse Shortest-Path Problem

✍ Jianzhong Zhang; Yixun Lin 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 292 KB