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

Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case

โœ Scribed by I. B. Bourdonov; A. S. Kossatchev; V. V. Kuliamin

Book ID
111603164
Publisher
SP MAIK Nauka/Interperiodica
Year
2004
Tongue
English
Weight
124 KB
Volume
30
Category
Article
ISSN
0361-7688

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
โœ J.X. Hao; J.B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum