An efficient parallel construction of optimal independent spanning trees on hypercubes

DOI10.1016/J.JPDC.2012.07.003zbMATH Open1270.68036OpenAlexW2018477012MaRDI QIDQ362597FDOQ362597

Authors: Jeeraporn Werapun, Sarun Intakosum, Veera Boonjing 

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

double pointer jumpinghypercube interconnection networksISTs (independent spanning trees)multicomputersmulticoresparallel computersreliable and fault-tolerant broadcasting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Optimum broadcasting and personalized communication in hypercubes
• Independent trees in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Independent trees in planar graphs
• Title not available (Why is that?)

Cited In (5)

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

This page was built for publication: An efficient parallel construction of optimal independent spanning trees on hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362597)