Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures (Q3304759)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7227050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures |
scientific article; zbMATH DE number 7227050 |
Statements
Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures (English)
0 references
3 August 2020
0 references
shortest path problems
0 references
graph algorithms
0 references
distributed computing
0 references
GPU computing
0 references
graph partitioning
0 references
0.8608242869377136
0 references
0.8426311612129211
0 references
0.8333985805511475
0 references
