DC-RST: a parallel algorithm for random spanning trees in network analytics.
Luke HenkeDinesh MehtaPublished in: Appl. Netw. Sci. (2024)
Keyphrases
- parallel algorithm
- spanning tree
- parallel computation
- minimum spanning tree
- edge disjoint
- minimum cost
- minimum spanning trees
- parallel programming
- shared memory
- interconnection networks
- cluster of workstations
- binary search trees
- parallel implementations
- parallel version
- search tree
- heuristic search
- peer to peer
- medial axis transform
- probabilistic model