Another adaptive distributed shortest path algorithm

DOI10.1109/26.87189zbMath0738.90081OpenAlexW1966441918MaRDI QIDQ3986974

Pierre A. Humblet

Publication date: 28 June 1992

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2097e242dcb1555dbf9187e40a1a45d3e2ace4d1

zbMATH Keywords

shortest pathsdistributed algorithmchanging topology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A loop-free shortest-path routing algorithm for dynamic networks ⋮ A fully dynamic algorithm for distributed shortest paths. ⋮ Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios ⋮ Engineering a new algorithm for distributed shortest paths on dynamic networks ⋮ Partially dynamic efficient algorithms for distributed shortest paths