✦ LIBER ✦

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

✍ Scribed by Chan, Timothy M.

Book ID: 118181037
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 251 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/08071990x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster Algorithms for All-pairs Approxim

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

✍ Baswana, Surender; Kavitha, Telikepalli 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 526 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

Efficient parallel algorithms for comput

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

✍ Yijie Han; V. Y. Pan; J. H. Reif 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 820 KB

All-Pairs Bottleneck Paths in Vertex Wei

All-Pairs Bottleneck Paths in Vertex Weighted Graphs

✍ Asaf Shapira; Raphael Yuster; Uri Zwick 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 364 KB

All-Pairs Shortest Paths with Real Weigh

All-Pairs Shortest Paths with Real Weights in

✍ Timothy M. Chan 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 259 KB

A Branch-Checking Algorithm for All-Pair

A Branch-Checking Algorithm for All-Pairs Shortest Paths

✍ Cees Duin 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 167 KB