✦ LIBER ✦

Solving path problems on the GPU

✍ Scribed by Aydın Buluç; John R. Gilbert; Ceren Budak

Book ID: 103878433
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 458 KB
Volume: 36
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2009.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for solving the conditional c

Algorithms for solving the conditional covering problem on paths

✍ Brian J. Lunday; J. Cole Smith; Jeffrey B. Goldberg 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Solving min-max shortest-path problems o

Solving min-max shortest-path problems on a network

✍ Ishwar Murthy; Shenq-Shyong Her 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri

Sparse systems solving on GPUs with GMRE

Sparse systems solving on GPUs with GMRES

✍ Raphaël Couturier; Stéphane Domas 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 613 KB

Solving the shortest-paths problem on bi

Solving the shortest-paths problem on bipartite permutation graphs efficiently

✍ Lin Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 498 KB

An alternate path to stoichiometric prob

An alternate path to stoichiometric problem solving

✍ Hans-Jürgen Schmidt 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 696 KB

A successful algorithm for solving direc

A successful algorithm for solving directed Hamiltonian path problems

✍ Gerald L. Thompson; Sharad Singhal 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 473 KB