Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
Crossref DOI link: https://doi.org/10.1007/s11042-022-12066-0
Published Online: 2022-02-09
Published Print: 2022-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hanif, Muhammad Kashif http://orcid.org/0000-0001-5150-2228
Zimmermann, Karl-Heinz
Anees, Asad
Text and Data Mining valid from 2022-02-09
Version of Record valid from 2022-02-09
Article History
Received: 14 October 2020
Revised: 9 August 2021
Accepted: 4 January 2022
First Online: 9 February 2022