𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An O(|V|3) algorithm for finding maximum flows in networks

✍ Scribed by V.M. Malhotra; M.Pramodh Kumar; S.N. Maheshwari

Book ID
113161965
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
366 KB
Volume
7
Category
Article
ISSN
0020-0190

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.