A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree

DOI10.1007/978-3-642-40450-4_14zbMath1395.68205OpenAlexW2110993948MaRDI QIDQ2849307

Davide Bilò, Guido Proietti, Luciano Gualà

Publication date: 17 September 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_14

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A faster computation of all the best swap edges of a shortest paths tree

This page was built for publication: A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree