Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
type: Item
instance of: scholarly article
title: Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
zbMATH Open document ID: 1347.68018
author: Gianlorenzo D'Angelo
author: Mattia D'Emidio
author: Daniele Frigioni
author: Daniele Romano
published in: Theory of Computing Systems
publication date: 2016-01-28T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6536612
zbMATH Keywords: design and analysis of algorithms
zbMATH Keywords: computer communication networks
zbMATH Keywords: distributed algorithms
zbMATH Keywords: dynamic algorithms
zbMATH Keywords: shortest paths
zbMATH Keywords: experimental analysis
describes a project that uses: OMNet++
MaRDI profile type: Publication
full work available at URL: s00224-015-9608-6
OpenAlex ID: W2054131032
cites work: Emergence of Scaling in Random Networks
cites work: Q3361866
cites work: Partially dynamic efficient algorithms for distributed shortest paths
cites work: Engineering a new algorithm for distributed shortest paths on dynamic networks
cites work: A fully dynamic algorithm for distributed shortest paths.
cites work: A loop-free shortest-path routing algorithm for dynamic networks
cites work: Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks
cites work: Another adaptive distributed shortest path algorithm
cites work: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
cites work: Distributed shortest-path protocols for time-dependent networks
cites work: Q3391607
cites work: On finding and updating shortest paths distributively
DOI: 10.1007/S00224-015-9608-6
description: scientific article; zbMATH DE number 6536612