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

An Algorithm for finding optimum path in networks

โœ Scribed by Kabekode V.S. Bhat

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
242 KB
Volume
314
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.

๐Ÿ“œ SIMILAR VOLUMES

A 2-Approximation Algorithm for Finding
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
โœ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-ลฝ . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs ลฝ and of k-out-connected graphs i.e., graphs which contain a vertex

On finding shortest paths in nonnegative
On finding shortest paths in nonnegative networks
โœ A. Rosenthal ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

A modification of Dantzig's algorithm for the all! pairs shortest paths problem is given. The new algorithm applies only to graphs with nonnegative arc lengths. For an IV-node compkte graph ir has a worst case running time of fN3 triple operations of the form D-: = min(D--D-~+D~$ and iv" log N other