Efficient parallel algorithms for shortest paths in planar graphs
From MaRDI portal
Publication:5056111
DOI10.1007/3-540-52846-6_98zbMath1502.68243OpenAlexW1608198357MaRDI QIDQ5056111
Paul G. Spirakis, Grammati E. Pantziou, Christos D. Zaroliagis
Publication date: 9 December 2022
Published in: SWAT 90 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52846-6_98
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Designing networks with compact routing tables
- Deterministic coin tossing with applications to optimal parallel list ranking
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- Parallel Matrix and Graph Algorithms
- New Bounds on the Complexity of the Shortest Path Problem
- Planar graph decomposition and all pairs shortest paths
- A simple parallel tree contraction algorithm
- Efficient parallel algorithms for shortest paths in planar graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Theorem on Boolean Matrices
This page was built for publication: Efficient parallel algorithms for shortest paths in planar graphs
