Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures

DOI10.1007/978-3-319-26520-9_5zbMath1440.68185arXiv1503.07192OpenAlexW1810600064MaRDI QIDQ3304759

Guillaume Chapuis, Hristo N. Djidjev

Publication date: 3 August 2020

Published in: Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.07192

zbMATH Keywords

graph partitioninggraph algorithmsdistributed computingshortest path problemsGPU computing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• A note on two problems in connexion with graphs
• Shortest path queries in planar graphs
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Planar graph decomposition and all pairs shortest paths

This page was built for publication: Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures