Embedding graphs with bounded treewidth into optimal hypercubes [chapter]

Volker Heun, Ernst W. Mayr
1996 Lecture Notes in Computer Science  
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 very irregular structure into hypercubes are investigated. The dilation of the presented embedding is bounded by 3dlog((d+1)(t+1))e+8, where t denotes the treewidth of the graph and d denotes the maximal degree of a vertex in the graph. The given embedding is a generalization of our method to embed arbitrary binary trees into
more » ... optimal hypercubes given in [HM93] . Moreover, if the given graph has constant treewidth or is represented by a tree-decomposition of width t, this embedding can be efficiently implemented on the optimal hypercube itself. 2
doi:10.1007/3-540-60922-9_14 fatcat:olbl6l2tunatjb7nsecjzosdi4