✦ LIBER ✦

All-Pairs Shortest Paths with Real Weights in

✍ Scribed by Timothy M. Chan

Book ID: 106148797
Publisher: Springer
Year: 2007
Tongue: English
Weight: 259 KB
Volume: 50
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9062-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

All-Pairs Almost Shortest Paths

✍ Dor, Dorit; Halperin, Shay; Zwick, Uri 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 244 KB

A new approach to all-pairs shortest pat

A new approach to all-pairs shortest paths on real-weighted graphs

✍ Seth Pettie 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 380 KB

We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. It runs in O(mn + n 2 log log n) time, improving on the long-standing bound of O(mn + n 2 log n) derived from an implementation of Dijkstra's algorithm with Fibonacci

More Algorithms for All-Pairs Shortest P

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

✍ Chan, Timothy M. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 251 KB

All-pairs shortest paths and the essenti

All-pairs shortest paths and the essential subgraph

✍ C. C. McGeoch 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 926 KB

Shortest paths in networks with vector w

Shortest paths in networks with vector weights

✍ H. W. Corley; I. D. Moon 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 381 KB

An all-pairs shortest-path distributed a

An all-pairs shortest-path distributed algorithm

✍ Sam Toueg 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 144 KB