Minimal path length of trees with known fringe (Q673649): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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(95)80019-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106055224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal path length of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Upper and Lower Bounds on the Path Length of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the path length of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound for the path length of AVL trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for the Total Path Length of Binary Trees / rank
 
Normal rank

Latest revision as of 10:27, 27 May 2024

scientific article
Language Label Description Also known as
English
Minimal path length of trees with known fringe
scientific article

    Statements

    Minimal path length of trees with known fringe (English)
    0 references
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    time algorithm
    0 references
    minimal tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references