Shortest Path Algorithms for Nearly Acyclic Directed Graphs

Shortest Path Algorithms for Nearly Acyclic Directed Graphs (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Tadao Takaoka

Venue:	Comput. Sci
Citations:	5 - 5 self

BibTeX

@ARTICLE{Takaoka97shortestpath,
    author = {Tadao Takaoka},
    title = {Shortest Path Algorithms for Nearly Acyclic Directed Graphs},
    journal = {Comput. Sci},
    year = {1997},
    volume = {293},
    pages = {535--556}
}

Bookmark

OpenURL

Abstract

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 directed graph and t is the number of delete-min operations in the priority queue manipulation. They use the Fibonacci heap for the priority queue. If the graph is acyclic, we have t = 0 and the time complexity becomes O(m + n) which is linear and optimal. They claim that if the graph...

Citations

801	Depth-first search and linear graph algorithms - Tarjan - 1972
657	A note on Two Problems in Connection with Graphs - Dijkstra
557	Data Structures and Network Algorithms - Tarjan - 1983
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
257	RW: Algorithm 97 Shortest Path - Floyd - 1969
106	Fast algorithms for shortest paths in planar graphs, with applications - Frederickson - 1987
35	Depth- rst search and linear graph algorithms - Tarjan - 1972
30	An all pairs shortest path algorithm with expected time O(n 2 log n - Moffat, Takaoka - 1987
13	Shortest path queries in digraphs of small treewidth - Chaudhuri, Zaroliagis - 1995
7	Are Fibonacci heaps optimal - Abuaiadh, Kingston
1	A New Upper Bound on the Complexity - Takaoka - 1992
1	An all pairs shortest path algorithm with expected time O(n 2 log n - at, A, et al. - 1987