Comments on 'Parallel algorithms for finding a near-maximum independent set of a circle graph' [with reply].
Evan W. SteegYoshiyasu TakefujiKuo Chun LeePublished in: IEEE Trans. Neural Networks (1991)
Keyphrases
- parallel algorithm
- maximum independent set
- graph theory
- independent set
- graph theoretic
- parallel computation
- parallel programming
- discovery of association rules
- shared memory
- pc cluster
- parallel implementations
- spanning tree
- directed graph
- parallel version
- cluster of workstations
- np hard
- combinatorial search problems
- parallel computers
- combinatorial optimization
- random walk