A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem

DOI10.1007/978-3-642-17461-2_18zbMath1311.05197OpenAlexW1817899449MaRDI QIDQ3066460

Bang Ye Wu

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_18

zbMATH Keywords

algorithmshortest pathtime complexitynext-to-shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem