Incremental algorithms for the single-source shortest path problem

DOI10.1007/3-540-58715-2_118MaRDI QIDQ4470497zbMATH OpenFDO

Authors Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58715-2_118

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• A dynamic topological sort algorithm for directed acyclic graphs
• Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques

This page was built for publication: Incremental algorithms for the single-source shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470497)