Improved shortest path algorithms for nearly acyclic graphs

Electronic Notes in Theoretical Computer Science

Volumn 42, Issue , 2001, Pages 243-259

  Saunders, Shane ^a   Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; PARAMETER ESTIMATION; PROBLEM SOLVING; QUEUEING THEORY; SET THEORY;

DIJKSTRA'S ALGORITHMS; FIBONACCI HEAP; HYBRID ALGORITHMS; TAKAOKA'S ALGORITHMS;

GRAPH THEORY;

EID: 18944383076     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80888-0     Document Type: Conference Paper

References (7)

1. Abuaiadh D., Kingston J.H. Are Fibonacci heaps optimal? ISAAC '94. Lecture Notes in Computer Science :1994;41-50
2. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik. 1:1959;269-271
3. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimisation algorithms. Journal of the ACM. 34:(3):July 1987;596-615
4. Takaoka T. Shortest path algorithms for nearly acyclic directed graphs. Theoretical Computer Science. 203:(1):August 1998;143-150
5. T. Takaoka. Theory of 2-3 heaps. In Proc. COCOON '99, volume 1627 of Lecture Notes in Computer Science, pages 41-50. July 1999.
6. Takaoka T. Theory of trinomial heaps. COCOON '00, volume 1858 of Lecture Notes in Computer Science. July 2000;362-372
7. Tarjan R. Depth-first search and linear graph algorithms. SIAM Journal on Computing. 1:(2):June 1972;146-160