An efficient parallel construction of optimal independent spanning trees on hypercubes

DOI10.1016/j.jpdc.2012.07.003zbMath1270.68036MaRDI 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

zbMATH Keywords

parallel computers; double pointer jumping; hypercube interconnection networks; ISTs (independent spanning trees); multicomputers; multicores; reliable and fault-tolerant broadcasting

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M07: Mathematical problems of computer architecture

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

The generalized 4-connectivity of hypercubes, Linear time algorithms for finding independent spanning trees on pyramid networks, Construction independent spanning trees on locally twisted cubes in parallel, Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

Cites Work

• Independent trees in planar graphs
• Independent trees in graphs
• Optimum broadcasting and personalized communication in hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item