Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
Crossref DOI link: https://doi.org/10.1007/s10703-016-0246-7
Published Online: 2016-04-06
Published Print: 2016-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Wijs, Anton
Katoen, Joost-Pieter
Bošnački, Dragan
License valid from 2016-04-06