Shortest Path Tree Computation in Dynamic Graphs

DOI10.1109/TC.2008.198zbMath1367.05200MaRDI QIDQ4974985

Yaya Yang, Edward P. F. Chan

Publication date: 8 August 2017

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ Shortest paths avoiding forbidden subpaths ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ A single-source shortest path algorithm for dynamic graphs ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ Dynamically Maintaining Shortest Path Trees under Batches of Updates

This page was built for publication: Shortest Path Tree Computation in Dynamic Graphs