Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm (Q1232421)
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: Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm |
scientific article; zbMATH DE number 3536129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm |
scientific article; zbMATH DE number 3536129 |
Statements
Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm (English)
0 references
1974
0 references
