Embeddings of binary trees in lines (Q1058856): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90050-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995744895 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    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

    Identifiers