The node visit cost of brother trees (Q1098304): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Axioms and hulls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3219751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary Search Trees of Bounded Balance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal-Cost Brother Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4096430 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the correspondence between AVL trees and brother trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Right brother trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1-2 Brother Trees or AVL Trees Revisited / rank | |||
Normal rank |
Latest revision as of 14:53, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The node visit cost of brother trees |
scientific article |
Statements
The node visit cost of brother trees (English)
0 references
1987
0 references
brother search tree
0 references
node visit cost
0 references