✦ LIBER ✦

Improved Shortest Path Algorithms for Nearly Acyclic Graphs

✍ Scribed by Shane Saunders; Tadao Takaoka

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 210 KB
Volume: 42
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80888-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved shortest path algorithms for ne

Improved shortest path algorithms for nearly acyclic graphs

✍ Shane Saunders; Tadao Takaoka 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Dijkstra's algorithm solves the single-source shortest path problem on any directed graph in O(m + n log n) time when a Fibonacci heap is used as the frontier set data structure. Here n is the number of vertices and m is the number of edges in the graph. If the graph is nearly acyclic, other algorit

Shortest path algorithms for nearly acyc

Shortest path algorithms for nearly acyclic directed graphs

✍ Tadao Takaoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m + n log t) computing time, where m and n are the numbers of edges and vertices of the given directed graph and t is the number of delete-min operations in the priority qu

Faster Shortest-Path Algorithms for Plan

Faster Shortest-Path Algorithms for Planar Graphs

✍ Monika R Henzinger; Philip Klein; Satish Rao; Sairam Subramanian 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 445 KB

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we gi

A shortest path algorithm for grid graph

A shortest path algorithm for grid graphs

✍ F. O. Hadlock 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

Dynamic algorithms for shortest paths in

Dynamic algorithms for shortest paths in planar graphs

✍ Esteban Feuerstein; Alberto Marchetti-Spaccamela 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 887 KB

An Optimal Shortest Path Parallel Algori

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f