✦ LIBER ✦

A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem

✍ Scribed by Carson, John S.; Law, Averill M.

Book ID: 118172263
Publisher: Society for Industrial and Applied Mathematics
Year: 1977
Tongue: English
Weight: 327 KB
Volume: 6
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0206050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient VLSI algorithm for the all

An efficient VLSI algorithm for the all pairs shortest path problem

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Subcubic Cost Algorithms for the All Pai

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

✍ T. Takaoka 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 95 KB

A sharper analysis of a parallel algorit

A sharper analysis of a parallel algorithm for the all pairs shortest path problem

✍ Qian Ping Gu; Tadao Takaoka 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 457 KB

A priority queue for the all pairs short

A priority queue for the all pairs shortest path problem

✍ Alistair Moffat; Tadao Takaoka 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 410 KB

A simpleO(n2) algorithm for the all-pair

A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph

✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a

A Branch-Checking Algorithm for All-Pair

A Branch-Checking Algorithm for All-Pairs Shortest Paths

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