Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition

DOI10.1006/jagm.1996.0048zbMath0857.68086OpenAlexW2027428596MaRDI QIDQ4895808

Edith Cohen

Publication date: 3 March 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0048

zbMATH Keywords

reachability problemshortest-paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Faster shortest-path algorithms for planar graphs

This page was built for publication: Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition