Solving path problems on the GPU
From MaRDI portal
Publication:991105
DOI10.1016/J.PARCO.2009.12.002zbMATH Open1204.68043OpenAlexW2102067213MaRDI QIDQ991105FDOQ991105
Authors: Aydin Buluç, J. R. Gilbert, Ceren Budak 
Publication date: 2 September 2010
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.parco.2009.12.002
Recommendations
Gaussian eliminationgraph algorithmlinear algebrashortest pathmatrix multiplicationsemiringgraphical processing unitall-pairs shortest-paths
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gaussian elimination is not optimal
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- A set of level 3 basic linear algebra subprograms
- Title not available (Why is that?)
- Cache-oblivious dynamic programming
- Locality of Reference in LU Decomposition with Partial Pivoting
- R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- A Unified Approach to Path Problems
- The input/output complexity of transitive closure
Cited In (6)
- Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
- Using GPU computing for solving the two-dimensional guillotine cutting problem
- Solving the examination timetabling problem in GPUs
- Experiments-based parameter identification on the GPU for cooperative systems
- Utilization of OpenCL for large graph problems on graphics processing unit
- Route relaxations on GPU for vehicle routing problems
Uses Software
This page was built for publication: Solving path problems on the GPU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991105)
