An efficient parallel algorithm for shortest paths in planar layered digraphs
From MaRDI portal
Publication:1899220
DOI10.1007/BF01294130zbMath0834.68041OpenAlexW1972455324MaRDI QIDQ1899220
Roberto Tamassia, Jeffrey Scott Vitter, Sairam Subramanian
Publication date: 18 March 1996
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01294130
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Dynamic maintenance of planar digraphs, with applications
- Finding small simple cycle separators for 2-connected planar graphs
- The parallel computation of minimum cost paths in graphs by stream contraction
- Fast and efficient solution of path algebra problems
- On a routing problem
- Efficient Parallel Algorithms for String Editing and Related Problems
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Applications of a Planar Separator Theorem
- The Recognition of Series Parallel Digraphs
- Parallel Transitive Closure and Point Location in Planar Structures
