Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm.
Saved in:
| Title: | Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm. |
|---|---|
| Authors: | Burkov, V. N., Groppen, V. O. |
| Source: | Automation & Remote Control; September 1974, Vol. 35, p1468-2, 8p |
| Database: | Applied Science & Technology Source |
| ISSN: | 00051179 |
|---|
