A Parallel Algorithm that Enumerates all the Cliques in an Undirected Graph.
A. S. BavanPublished in: SCSS (1) (2007)
Keyphrases
- parallel algorithm
- undirected graph
- graph structure
- directed graph
- spanning tree
- approximation algorithms
- connected components
- complex networks
- directed acyclic graph
- positive integer
- weighted graph
- parallel computation
- minimum cost
- shared memory
- medial axis transform
- discovery of association rules
- binary search trees
- graphical models
- superpixels
- parallel version
- cluster of workstations
- parallel programming
- parallel implementations
- random walk
- np hard
- random variables
- markov chain
- processor array