Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter

DOI10.1007/978-3-642-35926-2_10zbMath1293.05371OpenAlexW115237389MaRDI QIDQ2876562

Sanjeev Saxena, Jay Mahadeokar

Publication date: 19 August 2014

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-35926-2_10

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

This page was built for publication: Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter