On the structure of all minimum cuts in a network and applications (Q3885550): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFb0120902 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0120902 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4234163381 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFB0120902 / rank | |||
Normal rank | |||
Latest revision as of 23:17, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the structure of all minimum cuts in a network and applications |
scientific article |
Statements
On the structure of all minimum cuts in a network and applications (English)
0 references
1980
0 references
structure of all minimum cuts
0 references
maximum flow
0 references
enumeration
0 references
sensitivity
0 references
parametric analyses of networks
0 references
vertex packing
0 references
maximum closure problems
0 references
unconstrained pseudo-boolean optimization
0 references
project selection
0 references
finite directed network
0 references
positive arc capacities
0 references
