Now showing items 1-1 of 1
Shortest path algorithms for nearly acyclic directed graphs
(University of Canterbury. Computer Science and Software Engineering, 1997)
Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m+n log t) computing time, where m and n are the numbers of edges and vertices of the given ...