An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Elias DahlhausMarek KarpinskiPierre KelsenPublished in: Inf. Process. Lett. (1992)
Keyphrases
- independent set
- parallel algorithm
- parallel computation
- parallel programming
- maximum weight
- multicore processors
- parallel version
- cluster of workstations
- medial axis transform
- shared memory
- multi dimensional
- maximum independent set
- binary search trees
- search algorithm
- dominant points
- np hard
- discovery of association rules