Abstract: This paper proposes a parallel implementation of the Bron-Kerbosch algorithm, which finds all maximal cliques in large, complex graphs using CPU and thread-level parallelism and distributed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback