Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees.
H. NarayananHuzur SaranVijay V. VaziraniPublished in: SODA (1992)
Keyphrases
- parallel algorithm
- edge disjoint
- spanning tree
- total length
- parallel computation
- greedy algorithm
- minimum spanning tree
- minimum cost
- parallel version
- minimum spanning trees
- combinatorial optimization
- parallel computers
- pc cluster
- shared memory
- discovery of association rules
- combinatorial search problems
- parallel programming
- running times
- weighted graph
- parallel implementations
- computational complexity