A parallel algorithm for constructing independent spanning trees in twisted cubes.
Jou-Ming ChangTing-Jyun YangJinn-Shyong YangPublished in: Discret. Appl. Math. (2017)
Keyphrases
- parallel algorithm
- spanning tree
- edge disjoint
- minimum spanning tree
- parallel computation
- parallel programming
- minimum spanning trees
- minimum cost
- cluster of workstations
- parallel version
- parallel implementations
- depth first search
- lower bound
- binary search trees
- message passing interface
- discovery of association rules