A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new-old algorithm for minimum-cut and maximum-flow in closure graphs. |
scientific article; zbMATH DE number 1652820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new-old algorithm for minimum-cut and maximum-flow in closure graphs. |
scientific article; zbMATH DE number 1652820 |
Statements
30 July 2002
0 references
closure graph
0 references
maximum flow
0 references
minimum-cut
0 references
sensitivity analysis
0 references
Lerchs-Grossmann algorithm
0 references
0 references
0 references
0 references
0 references
A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (English)
0 references
Closure graphs form a special subclass of digraphs; they include a source and sink in which only source adjacent arcs and sink adjacent arcs have finite capacities. The paper presents an algorithm for solving the minimum-cut problem on this class of digraphs based on the Lerchs-Grossmann algorithms without using the concept of a flow.
0 references
