A distance metric on binary trees using lattice-theoretic measures (Q910191): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Metrics on spaces of finite trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path length in the covering graph of a lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The average height of binary trees and other simple trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Height on posets and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the upper bound on the rotation distance of binary trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Metrics on partially ordered sets - a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank | |||
Normal rank |
Latest revision as of 14:50, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A distance metric on binary trees using lattice-theoretic measures |
scientific article |
Statements
A distance metric on binary trees using lattice-theoretic measures (English)
0 references
1990
0 references
rotation lattice
0 references
binary trees
0 references
distance metric
0 references