Embedding of binomial trees in hypercubes with link faults

DOI10.1006/JPDC.1998.1482MaRDI QIDQ1273888zbMATH OpenOpenAlexFDO

Authors Jie Wu, Eduardo B. Fernandez, Yingqiu Luo

Publication date 19 April 1999

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1998.1482

zbMATH Keywords

embedding schemeshypercubespanning binomial trees

Mathematics Subject Classification ID

Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1138356
• scientific article; zbMATH DE number 2062237
• Embedding meshes in hypercubes with edge faults
• On the embedding of a class of regular graphs in a faulty hypercube
• scientific article; zbMATH DE number 1759412

Cited in

(5)

• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• An algorithm to construct independent spanning trees on parity cubes
• scientific article; zbMATH DE number 2062237 (Why is no real title available?)
• Embedding augmented cube into certain trees and windmill graphs

This page was built for publication: Embedding of binomial trees in hypercubes with link faults

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