Completely Independent Spanning Trees on Some Interconnection Networks.
Kung-Jui PaiJinn-Shyong YangSing-Chen YaoShyue-Ming TangJou-Ming ChangPublished in: IEICE Trans. Inf. Syst. (2014)
Keyphrases
- completely independent
- interconnection networks
- spanning tree
- fault tolerant
- multistage
- parallel algorithm
- edge disjoint
- message passing
- routing algorithm
- minimum spanning tree
- minimum cost
- finite state
- parallel computers
- minimum spanning trees
- distributed systems
- weighted graph
- markov decision processes
- data processing
- machine learning
- parallel implementation
- massively parallel
- markov chain
- total length
- computer science