Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (Q905697)
From MaRDI portal
!
WARNING
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 6536612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios |
scientific article; zbMATH DE number 6536612 |
Statements
Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (English)
0 references
28 January 2016
0 references
design and analysis of algorithms
0 references
computer communication networks
0 references
distributed algorithms
0 references
dynamic algorithms
0 references
shortest paths
0 references
experimental analysis
0 references
0.9483712315559388
0 references
0.8126605749130249
0 references
0.7690790295600891
0 references
0.7509154081344604
0 references
