Shortest Path Algorithms for Nearly Acyclic Directed Graphs

Tadao Takaoka. Shortest Path Algorithms for Nearly Acyclic Directed Graphs. In Fabrizio d Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela, editors, Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG 96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Volume 1197 of Lecture Notes in Computer Science, pages 367-374, Springer, 1996.

Abstract

Abstract is missing.