Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (Q905697): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-015-9608-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054131032 / rank | |||
Normal rank | |||
Revision as of 19:58, 19 March 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
