Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition

• 30 September 1996
• journal article
• Published by Elsevier in Journal of Algorithms
• Vol. 21  (2) , 331-357
• https://doi.org/10.1006/jagm.1996.0048

Abstract

Keywords

• DIGRAPHS
• SEPARATOR DECOMPOSITION
• SHORTEST PATHS
• EFFICIENT PARALLEL SHORTEST