A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Embedding of tree networks into hypercubes
1985
Journal of Parallel and Distributed Computing
The hypercube is a good host graph for the embedding of networks of processors because of its low degree and low diameter. Graphs such as trees and arrays can be embedded into a hypercube with small dilation and expansion costs, but there are classes of graphs which can be embedded into a hypercube only with large expansion COSt or large dilation CO% 8 1985 AC&I& Ress, Inc.
doi:10.1016/0743-7315(85)90026-7
fatcat:x6sbsgxkhbf6rblz3nknyqopcu