On some optimal embeddings of binary and ternary trees in planar rectangular lattices (Q2563387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 957044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some optimal embeddings of binary and ternary trees in planar rectangular lattices |
scientific article; zbMATH DE number 957044 |
Statements
On some optimal embeddings of binary and ternary trees in planar rectangular lattices (English)
0 references
11 December 1996
0 references
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.
0 references
optimal embedding
0 references
graph
0 references
tree
0 references
rectangular grid
0 references
distributed computing
0 references
0.8453640341758728
0 references
0.8083452582359314
0 references
