A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs.
Farid AlizadehPublished in: SODA (1991)
Keyphrases
- parallel algorithm
- binary search trees
- maximum clique
- parallel computation
- parallel programming
- graph matching
- shared memory
- parallel version
- association graph
- cluster of workstations
- medial axis transform
- parallel computers
- discovery of association rules
- parallel implementations
- data structure
- graph theory
- maximal cliques
- multicore processors
- spanning tree
- operating system
- dominant points
- input image
- scheduling problem