Solving shortest paths efficiently on nearly acyclic directed graphs

DOI10.1016/j.tcs.2006.10.008zbMath1118.68108OpenAlexW2076704871MaRDI QIDQ868945

Shane Saunders, Tadao Takaoka

Publication date: 26 February 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10092/14775

zbMATH Keywords

graph decompositionnearly acyclic graphshortest path algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Partial Solution and Entropy ⋮ Sharing information for the all pairs shortest path problem

Cites Work

• A note on two problems in connexion with graphs
• Shortest path algorithms for nearly acyclic directed graphs
• Improved shortest path algorithms for nearly acyclic graphs
• A new approach to all-pairs shortest paths on real-weighted graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving shortest paths efficiently on nearly acyclic directed graphs