A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract).
Elias DahlhausMarek KarpinskiPublished in: SWAT (1988)
Keyphrases
- extended abstract
- related problems
- parallel algorithm
- maximal cliques
- graph theory
- graph theoretic
- maximal clique enumeration
- maximum clique
- complex networks
- association graph
- parallel computation
- parallel version
- protein interaction networks
- fully connected
- cluster of workstations
- massive data
- graph structure
- data mining
- branch and bound algorithm
- graph mining
- structured data
- social networks