✦ LIBER ✦

A simplified algorithm for the all pairs shortest path problem withO(n2logn) expected time

✍ Scribed by Tadao Takaoka

Book ID: 120694211
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 415 KB
Volume: 25
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9550-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Note on Spira’s Algorithm for the All-

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

✍ Carson, John S.; Law, Averill M. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 327 KB

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

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 mean-time comparison of algorithms for

A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths

✍ W. D. Kelton; A. M. Law 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB