Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm (Q1232421)
From MaRDI portal
scientific article
| 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 |
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
