Finding the <i>n</i> Most Vital Nodes in a Flow Network (Q4077761)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3495891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the <i>n</i> Most Vital Nodes in a Flow Network |
scientific article; zbMATH DE number 3495891 |
Statements
Finding the <i>n</i> Most Vital Nodes in a Flow Network (English)
0 references
1974
0 references
