Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (Q905697): Difference between revisions
From MaRDI portal
Latest revision as of 08:59, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios |
scientific article |
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