Now showing items 1-1 of 1
Improved Shortest Path Algorithms for Nearly Acyclic Directed Graphs
(University of Canterbury, 2012)
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. This decomposition is an extension of ...