Embedding of binomial trees in hypercubes with link faults
From MaRDI portal
Publication:1273888
DOI10.1006/jpdc.1998.1482zbMath0911.68154OpenAlexW2055774553MaRDI QIDQ1273888
Eduardo B. Fernandez, Jie Wu, 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
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)
Related Items (3)
An algorithm to construct independent spanning trees on parity cubes ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Wirelength of hypercubes into certain trees
This page was built for publication: Embedding of binomial trees in hypercubes with link faults
