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

Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm

โœ Scribed by Maria J. Blesa; Christian Blum

Publisher
Springer Netherlands
Year
2007
Tongue
English
Weight
935 KB
Volume
6
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for finding optimum path in
An Algorithm for finding optimum path in networks
โœ Kabekode V.S. Bhat ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

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.