There is a huge number of works on efficient solution of all-pairs shortest paths (APSP) by using GPGPU. But the main goal of these works is to compute the length of the shortest path. Are there exist works which investigate (or propose) efficient ways to get not only length but also the path (as a sequence of edges, for example) for real-world sparse graphs by using GPGPU?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.