Embeddings of binary trees in lines (Q1058856)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embeddings of binary trees in lines |
scientific article |
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
