Parallel algorithms for finding a near-maximum independent set of a circle graph.
Yoshiyasu TakefujiLi-Lin ChenKuo Chun LeeJohn HuffmanPublished in: IEEE Trans. Neural Networks (1990)
Keyphrases
- parallel algorithm
- maximum independent set
- graph theory
- graph theoretic
- independent set
- parallel computation
- cluster of workstations
- parallel implementations
- parallel version
- graph structure
- parallel programming
- lower bound
- discovery of association rules
- shared memory
- parallel computers
- directed graph
- social network analysis
- random walk
- general purpose
- real time
- combinatorial search problems