A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks.
Zhiyong PanBaolei ChengJianxi FanYan WangXiajing LiPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- parallel algorithm
- spanning tree
- edge weights
- minimum spanning trees
- undirected graph
- weighted graph
- minimum spanning tree
- minimum cost
- edge disjoint
- parallel computation
- interconnection networks
- parallel programming
- shared memory
- cluster of workstations
- medial axis transform
- parallel implementations
- binary search trees
- np hard
- graph construction
- network structure