Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (Q320688)
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: Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network |
scientific article; zbMATH DE number 6635684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network |
scientific article; zbMATH DE number 6635684 |
Statements
Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (English)
0 references
7 October 2016
0 references
combinatorial optimization
0 references
networks
0 references
reliability
0 references
graph theory
0 references
0.8469529
0 references
0.8462876
0 references
0.84136176
0 references
0.84082454
0 references
0.83899313
0 references
