Earliest arrival flows on series-parallel graphs (Q3082606)
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 5866471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Earliest arrival flows on series-parallel graphs |
scientific article; zbMATH DE number 5866471 |
Statements
Earliest arrival flows on series-parallel graphs (English)
0 references
16 March 2011
0 references
dynamic network flows
0 references
earliest arrival flows
0 references
universally maximal dynamic flows
0 references
discrete time setting
0 references
series-parallel graphs
0 references
polynomial algorithms
0 references
0.8474148511886597
0 references
0.81682950258255
0 references
0.8124653100967407
0 references
0.8116322159767151
0 references
0.8089231252670288
0 references
