The next‐to‐shortest path problem on directed graphs with positive edge weights

DOI10.1002/net.21598zbMath1386.05082OpenAlexW2063638960MaRDI QIDQ4642453

Hung-Lung Wang, Bang Ye Wu

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21598

zbMATH Keywords

algorithmdigraphdirected acyclic graphtime complexityplanar graph\(k\) shortest pathsnext-to-shortest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (2)

Simple paths with exact and forbidden lengths ⋮ Detours in directed graphs

This page was built for publication: The next‐to‐shortest path problem on directed graphs with positive edge weights