✦ LIBER ✦

Squashed embedding of E-R schemas in hypercubes

✍ Scribed by Chaitanya K. Baru; Piyush Goel

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 928 KB
Volume: 8
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(90)90132-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding of Binomial Trees in Hypercube

Embedding of Binomial Trees in Hypercubes with Link Faults

✍ Jie Wu; Eduardo B. Fernandez; Yingqiu Luo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 505 KB

Matrix Representation of Graph Embedding

Matrix Representation of Graph Embedding in a Hypercube

✍ Y.C. Tseng; T.H. Lai; L.F. Wu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 707 KB

The purpose of this paper is to demonstrate the use of matrices for the representation of graph embedding in a hypercube. We denote the image of an embedding (which is a subgraph of the hypercube) as a matrix. With this representation, we are able to simplify, unify, generalize, or improve existing

Distributed fault-tolerant embeddings of

Distributed fault-tolerant embeddings of rings in hypercubes

✍ Mee Yee Chan; Shiang-Jen Lee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 881 KB

Dense edge-disjoint embedding of complet

Dense edge-disjoint embedding of complete binary trees in the hypercube

✍ Somasundaram Ravindran; Alan Gibbons 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 407 KB

On the Embedding of a Class of Regular G

On the Embedding of a Class of Regular Graphs in a Faulty Hypercube

✍ Yu-Chee Tseng; Ten-Hwang Lai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Performance evaluation of a random-walk-

Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks

✍ Keqin Li 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views