On some optimal embeddings of binary and ternary trees in planar rectangular lattices

MaRDI QIDQ2563387zbMATH OpenFDO

Authors Yanyan Li

Publication date 11 December 1996

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

distributed computinggraphoptimal embeddingrectangular gridtree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Mathematical problems of computer architecture (68M07) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Review text

The problem of optimal modeling of distributed computing is one of the most important in the theory if discrete control systems. This problem can be reduced to an optimal embedding problem on graphs representing the connections between the elementary processor elements. A formulation of this problem is discussed in this paper for the case of tree embedding in rectangular grids.

Recommendations

• Optimal embedding of complete binary trees into lines and grids
• scientific article; zbMATH DE number 219230
• scientific article; zbMATH DE number 4031713
• Optimal two-sided embeddings of complete binary trees in rectangular grids

Cited in

(5)

• Embedding ternary trees in VLSI arrays
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• scientific article; zbMATH DE number 4031713 (Why is no real title available?)
• scientific article; zbMATH DE number 29721 (Why is no real title available?)
• Some asymptotically optimal one-sided embeddings of trees of similar formulas into rectangular lattices

This page was built for publication: On some optimal embeddings of binary and ternary trees in planar rectangular lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563387)