Parallel Algorithms for Finding Large Cliques in Sparse Graphs.
Lukas GianinazziMaciej BestaYannick SchaffnerTorsten HoeflerPublished in: CoRR (2021)
Keyphrases
- parallel algorithm
- maximum clique
- maximal cliques
- parallel computation
- shared memory
- weighted graph
- parallel programming
- graph structure
- cluster of workstations
- parallel implementations
- pc cluster
- branch and bound algorithm
- graph theory
- parallel version
- directed graph
- interconnection networks
- association graph
- load balancing
- search algorithm
- data structure
- discovery of association rules
- real time