A fully dynamic algorithm for distributed shortest paths.
type: Item
instance of: scholarly article
title: A fully dynamic algorithm for distributed shortest paths.
zbMATH Open document ID: 1044.68165
DOI: 10.1016/S0304-3975(02)00619-9
author: Serafino Cicerone
author: Gabriele Di Stefano
author: Daniele Frigioni
author: Umberto Nanni
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1965314
zbMATH Keywords: dynamic distributed environment
zbMATH Keywords: shortest paths
MaRDI profile type: Publication
cites work: Q3056948
cites work: Q3138876
cites work: Incremental algorithms for minimal length paths
cites work: Semidynamic algorithms for maintaining single-source shortest path trees
cites work: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
cites work: An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
cites work: Another adaptive distributed shortest path algorithm
cites work: Distributed shortest-path protocols for time-dependent networks
cites work: Bounded incremental computation
cites work: On the computational complexity of dynamic graph problems
cites work: On finding and updating shortest paths distributively
full work available at URL: s0304-3975(02)00619-9
OpenAlex ID: W2657967087
description: scientific article; zbMATH DE number 1965314