Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components.
Anton WijsJoost-Pieter KatoenDragan BosnackiPublished in: Formal Methods Syst. Des. (2016)
Keyphrases
- strongly connected
- parallel architectures
- graphics processing units
- directed graph
- graph theory
- decomposition algorithm
- depth first search
- computationally efficient
- parallel processing
- efficient implementation
- parallel computing
- parallel hardware
- independent set
- graphics hardware
- parallel computation
- massively parallel
- bayesian networks
- spanning tree
- graph mining
- general purpose
- data structure