Finding k shortest simple paths in directed graphs: A node classification algorithm

DOI10.1002/NET.21552zbMath1386.05045OpenAlexW1993451940MaRDI QIDQ4642475

No author found.

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithm\(k\) shortest pathsDijkstra algorithmreplacement pathssimple pathsnode classification

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs

This page was built for publication: Finding k shortest simple paths in directed graphs: A node classification algorithm