Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees.
H. NarayananHuzur SaranVijay V. VaziraniPublished in: SIAM J. Comput. (1994)
Keyphrases
- parallel algorithm
- edge disjoint
- spanning tree
- total length
- minimum spanning tree
- parallel computation
- greedy algorithm
- minimum cost
- shared memory
- parallel programming
- combinatorial optimization
- minimum spanning trees
- parallel implementations
- random walk
- parallel version
- discovery of association rules
- combinatorial search problems
- depth first search
- graphics processors
- running times
- distributed memory
- constraint satisfaction
- computational complexity