B. D. Handari

Application of Bron-Kerbosch algorithm in graph clustering using complement matrix

2017 · AIP conference proceedings

Maximal clique enumeration is a graph clustering method for finding all vertices that have the most influence in a graph. The Bron-Kerbosch algorithm is one of the fastest algorithms to find all maximal cliques. Hence, …