Binary trees equipped with semivaluations

DOI10.2989/16073600709486187MaRDI QIDQ5426701zbMATH OpenOpenAlexFDO

Authors H. Pajoohesh, M. Schellekens

Publication date 13 November 2007

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2989/16073600709486187

zbMATH Keywords

binary treedecision treelatticesemivaluation

Mathematics Subject Classification ID

Trees (05C05) Partial orders, general (06A06) Analysis of algorithms (68W40)

Recommendations

• Decision trees of algorithms and a semivaluation to measure their distance
• A distance metric on binary trees using lattice-theoretic measures
• Unbalanced subtrees in binary rooted ordered and un-ordered trees
• The pruning-grafting lattice of binary trees
• Short notes: Some Properties of the Rotation Lattice of Binary Trees

Cited in

(1)

• Decision trees of algorithms and a semivaluation to measure their distance

This page was built for publication: Binary trees equipped with semivaluations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426701)