On computing distances between leaves in a complete tree

DOI10.1080/00207168008803215MaRDI QIDQ3890125zbMATH OpenOpenAlexFDO

Authors Raymond E. Miller, Arnold L. Rosenberg

Publication date 1980

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168008803215

zbMATH Keywords

algorithmsdistances between leaves in a complete tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• An almost optimal algorithm for unbounded searching
• Data encodings and their costs
• Encoding Data Structures in Trees
• On Finding Lowest Common Ancestors in Trees
• Preserving average proximity in arrays
• Pyramids: A data type for matrix representation in Pascal

Cited in

(1)

• Searching and encoding for infinite ordered sets

This page was built for publication: On computing distances between leaves in a complete tree

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