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 Graphs with Bounded Treewidth into Their Optimal Hypercubes
2002
Journal of Algorithms
In this paper, we present a one-to-one embedding of a graph with bounded treewidth into its optimal hypercube. This is the first time that embeddings of graphs with a highly irregular structure into hypercubes are investigated. The presented embedding achieves dilation of at most 3 log d + 1 t + 1 + 8 and nodecongestion of at most O d dt 3 , where t denotes the treewidth of the graph and d denotes the maximal degree of a vertex in the graph. Provided that the graph is given by its
doi:10.1006/jagm.2002.1217
fatcat:j2udl5lcufh3jekk54aax4upue