Improved shortest path algorithms for nearly acyclic graphs

DOI10.1016/S0304-3975(02)00613-8zbMath1027.90101MaRDI QIDQ1395429

Shane Saunders, Tadao Takaoka

Publication date: 1 July 2003

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Solving shortest paths efficiently on nearly acyclic directed graphs ⋮ 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
• Fibonacci heaps and their uses in improved network optimization algorithms
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved shortest path algorithms for nearly acyclic graphs