DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS (Q5056602)
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 7629440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS |
scientific article; zbMATH DE number 7629440 |
Statements
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS (English)
0 references
8 December 2022
0 references
dynamic network
0 references
evacuation system
0 references
quickest time distribution
0 references
reliability
0 references
0 references
0 references
0.9286129
0 references
0.92077935
0 references
0.9146593
0 references
0.9141956
0 references
0 references
0.88416886
0 references
0.8799187
0 references
0.87774503
0 references
0.87738454
0 references
0.8761833
0 references
