Shortest path algorithms for nearly acyclic directed graphs

Theoretical Computer Science

Volumn 203, Issue 1, 1998, Pages 143-150

  Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Acyclic graph; Algorithm; Dijkstra's algorithm; Fibonacci heap; Nearly acyclic graph; Priority queue; Shortest paths

Indexed keywords

EID: 0012647739     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00292-2     Document Type: Article

References (9)

1. D. Abuaiadh, J.H. Kingston, Are Fibonacci heaps optimal? ISAAC'94, Lecture Notes in Computer Science, Springer, Berlin, 1954, pp. 442-450.
2. S. Chaudhuri, C.D. Zaroliagis, Shortest path queries in digraphs of small treewidth, Proc. of 22nd Internat. Colloq., ICALP95, Szeged, Hungary, July 1995, in Lecture Notes on Computer Science, vol. 944, Springer, Berlin, 1995, pp. 244-255.
3. E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959) 269-271.
4. R.W. Floyd, Algorithm 97: Shortest path, Comm. ACM 5 (1962) 345.
5. G.N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput. 16 (6) (1987) 1004-1022.
6. M.L. Fredman, R.E. Tarjan, Fibonacci heaps and their use in improved network optimization problems, J. ACM 34 (3) (1987) 596-615.
7. 2 log n), SIAM J. Comput. 16 (6) (1987) 1023-1031.
8. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1 (2) (1972) 146-160.
9. R.E. Tarjan, Data Structures and Network Algorithms, Regional Conf. Series in Applied Math., vol. 44, 1983.