DC-RST: A Parallel Algorithm for Random Spanning Trees in Network Analytics.
Lucas HenkeDinesh MehtaPublished in: COMPLEX NETWORKS (2) (2022)
Keyphrases
- parallel algorithm
- spanning tree
- minimum spanning tree
- edge disjoint
- minimum cost
- parallel computation
- peer to peer
- parallel programming
- minimum spanning trees
- parallel version
- shared memory
- interconnection networks
- medial axis transform
- cluster of workstations
- dominant points
- discovery of association rules
- wireless sensor networks
- database systems
- binary search trees
- parallel implementations
- cloud computing