Embeddings of binary trees in lines (Q1058856): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity Results for Bandwidth Minimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3914447 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on the costs of data encodings / rank | |||
Normal rank | |||
Latest revision as of 16:50, 14 June 2024
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
