A distance metric on binary trees using lattice-theoretic measures

DOI10.1016/0020-0190(90)90088-FzbMath0695.68017MaRDI QIDQ910191

N. E. Zubov

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

rotation latticebinary treesdistance metric

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Lattices (06B99)

Related Items (7)

Two shortest path metrics on well-formed parentheses strings ⋮ Matchings In Three Catalan Lattices ⋮ On the rotation distance between binary trees ⋮ The phagocyte lattice of Dyck words ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ The higher Stasheff‐Tamari posets ⋮ An algorithm to compute the möbius function of the rotation lattice of binary trees

Cites Work

• Metrics on spaces of finite trees
• Metrics on partially ordered sets - a survey
• The average height of binary trees and other simple trees
• Path length in the covering graph of a lattice
• On the upper bound on the rotation distance of binary trees
• Height on posets and graphs
• Enumerating, Ranking and Unranking Binary Trees

This page was built for publication: A distance metric on binary trees using lattice-theoretic measures