Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set.
Charles U. MartelPublished in: Inf. Process. Lett. (1986)
Keyphrases
- independent set
- parallel algorithm
- lower bound
- parallel computation
- maximum independent set
- parallel programming
- upper bound
- parallel version
- discovery of association rules
- maximum weight
- branch and bound
- objective function
- parallel implementations
- parallel computers
- interconnection networks
- cluster of workstations
- np hard
- pc cluster
- combinatorial search problems
- branch and bound algorithm
- distributed systems
- worst case
- data structure