On transmission time through \(k\) minimal paths of a capacitated-flow network (Q967798)
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: On transmission time through \(k\) minimal paths of a capacitated-flow network |
scientific article; zbMATH DE number 5703183
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On transmission time through \(k\) minimal paths of a capacitated-flow network |
scientific article; zbMATH DE number 5703183 |
Statements
On transmission time through \(k\) minimal paths of a capacitated-flow network (English)
0 references
2 May 2010
0 references
quickest path problem
0 references
capacitated-flow network
0 references
\(k\) minimal paths
0 references
system reliability
0 references
time constraint
0 references
0 references
0 references
0 references
0 references
