๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A shortest-path algorithm for Manhattan graphs

โœ Scribed by Kanchana Kanchanasut

Book ID
107766229
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
420 KB
Volume
49
Category
Article
ISSN
0020-0190

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

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