Embeddings of binary trees in lines (Q1058856)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Embeddings of binary trees in lines |
scientific article; zbMATH DE number 3902053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embeddings of binary trees in lines |
scientific article; zbMATH DE number 3902053 |
Statements
Embeddings of binary trees in lines (English)
0 references
1985
0 references
We show that any n-vertex binary tree can be embedded in a line with dilation-cost \(O(n/\log_ 2 n)\). A provided proof is fully constructive.
0 references
graph embedding
0 references
dilation cost
0 references
0.93180877
0 references
0.9291011
0 references
0.92618454
0 references
0.9102253
0 references
0.90732455
0 references
0 references
0.89950866
0 references
0.8966747
0 references
