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

Derivation of a distributed algorithm for finding paths in directed networks

โœ Scribed by Robert McCurley; Fred B. Schneider


Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
453 KB
Volume
6
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Algorithm for finding optimum path in
โœ 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.

Linear-speed interior-path algorithms fo
โœ Hanhua Feng; Cathy Xia; Zhen Liu; Li Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 509 KB

Many network-based problems are naturally distributed optimization problems. Examples include routing and flow control in wireless sensor networks, congestion pricing on the Internet, and resource allocation in distributed data-processing systems. Most of the distributed solutions provided by existi