Network flow interdiction on planar graphs (Q987697)
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: Network flow interdiction on planar graphs |
scientific article; zbMATH DE number 5770518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network flow interdiction on planar graphs |
scientific article; zbMATH DE number 5770518 |
Statements
Network flow interdiction on planar graphs (English)
0 references
13 August 2010
0 references
network flow interdiction
0 references
network robustness
0 references
planar graphs
0 references
planar duality
0 references
pseudo-polynomial algorithms
0 references
0.849301815032959
0 references
0.846447229385376
0 references
0.8417664170265198
0 references
0.8366596102714539
0 references
0.8249896764755249
0 references
