An efficient parallel construction of optimal independent spanning trees on hypercubes
Publication:362597
DOI10.1016/j.jpdc.2012.07.003zbMath1270.68036OpenAlexW2018477012MaRDI QIDQ362597
Veera Boonjing, Sarun Intakosum, Jeeraporn Werapun
Publication date: 22 August 2013
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0743731512001645
parallel computersdouble pointer jumpinghypercube interconnection networksISTs (independent spanning trees)multicomputersmulticoresreliable and fault-tolerant broadcasting
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Cites Work