Finding the k Shortest Paths in Parallel

Eric Ruppert. Finding the k Shortest Paths in Parallel. In Rüdiger Reischuk, Michel Morvan, editors, STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings. Volume 1200 of Lecture Notes in Computer Science, pages 475-486, Springer, 1997.

Abstract

Abstract is missing.