✦ LIBER ✦

Dynamic algorithms for shortest paths in planar graphs

✍ Scribed by Esteban Feuerstein; Alberto Marchetti-Spaccamela

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 887 KB
Volume: 116
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90328-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fully Dynamic Algorithms for Maintaining

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

✍ Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We propose fully dynamic algorithms for maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions, and weight updates of edges. The algorithms require linear space and optimal quer

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

Improved Shortest Path Algorithms for Ne

Improved Shortest Path Algorithms for Nearly Acyclic Graphs

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