In this paper the same problem on a very restricted family of source graphs, trees, is considered. It is shown that the problem of determining for a given tree ...
The problem of deciding if a given source graph is a partial subgraph of an n-dimensional cube has recently been shown to be NP-complete. In this paper the same ...
The problem of deciding if a given source graph is a partial subgraph of an n-dimensional cube has recently been shown to be NP-complete. In this paper the same ...
Greece. [11] A. Wagner and D. Corneil. Embedding trees in the hypercube is NP-complete. SIAM. Journal of Computing, 19(4):570-590, June 1990. [12] A. S. ...
It is shown that the problem of determining for a given tree T and integer k if T is a partial subgraph of a k-dimensional cube is NP-complete.
Embedding trees in a hypercube is NP-complete. Authors: A. Wagner. A. Wagner ... Embedding trees in a hypercube is NP-complete. Mathematics of computing.
May 25, 2014 · So I would like to injectively map the vertices of a complete binary tree, Td, which I denote by the binary sequences of length at most d, into ...
Missing: NP- | Show results with:NP-
We consider embeddings of the complete t-ary trees of depth k (denotation. Tk,t) as subgraphs into the hypercube of minimum dimension n. This n, de-.
The algorithm presented in this paper embeds an N node binary tree into a hypercube with expansion O(log N) and unit dilation.
hypercube is NP-complete. In this paper, dilated embedding and precise embed- ding of K-ary (K ≥ 3) complete trees into hypercubes are studied. A K-ary ...