𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Embedding ladders and caterpillars into the hypercube

✍ Scribed by Sergei Bezrukov; Burkhard Monien; Walter Unger; Gerd Wechsung


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
594 KB
Volume
83
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis


We present an embedding of generalized ladders as subgraphs into the hypercube. Through an embedding of caterpillars into ladders, we obtain an embedding of caterpillars into the hypercube. In this way we get almost all known results concerning the embedding of caterpillars into the hypercube. In addition we construct an embedding for some new types of caterpillars. Our results support the conjecture of Have1 (1984).


πŸ“œ SIMILAR VOLUMES


Embeddings of Hypercubes and Grids into
✍ M.C. Heydemann; J. Opatrny; D. Sotteau πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 644 KB

An embedding of a graph \(G\) into a graph \(H\) is an injective mapping \(f\) from the vertices of \(G\) into the vertices of \(H\) together with a mapping \(P_{f}\) of edges of \(G\) into paths in \(H\). The dilation of the embedding is the maximum taken over all the lengths of the paths \(P_{f}(x

Embedding Hypercubes and Related Network
✍ F. Annexstein πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 736 KB

In this paper we study the problem of how computations programmed for hypercubes, and their bounded-degree relatives, the shuffle-exchange and cube-connected-cycles, can be efficiently emulated by mesh-connected arrays of processing elements. The emulations we present are implemented via graph embed

On the embedding genus distribution of l
✍ Liangxia Wan; Yanpei Liu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 475 KB

In this work, the relations between ladder surface sets and cross surface sets are found. The embedding genus distribution of ladders can be obtained by using the genus distribution of cross type surface sets.

Embedding into the rectilinear grid
✍ Bandelt, Hans-JοΏ½rgen; Chepoi, Victor πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

We show that the embedding of metric spaces into the l 1 -grid β€«ήšβ€¬ 2 can be characterized in essentially the same fashion as in the case of the l 1 -plane ‫ޒ‬ 2 . In particular, a metric space can be embedded into β€«ήšβ€¬ 2 iff every subspace with at most 6 points is embeddable. Moreover, if such an emb

Embedding the attribute information into
✍ Kiyoshi Tanaka; Yasuhiro Nakamura; Kineo Matsui Members πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 677 KB

## Abstract Attribute information is indispensable data in the collection and storage of a large amount of image information. If these data are stored together with the image, handling of the materials would become simpler and more reliable. This paper proposes a method to embed the attribute infor