Extremal properties of ?-weighted binary trees

DOI10.1007/BF01078899MaRDI QIDQ3817628zbMATH OpenOpenAlexFDO

Authors I. V. Komarovskij

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01078899

zbMATH Keywords

weighted treebinary treeexternal path lengthjoint file processing

Mathematics Subject Classification ID

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

Recommendations

• Publication:4735205
• Ranking the Best Binary Trees
• Alphabetic Minimax Trees
• scientific article; zbMATH DE number 3862455
• scientific article; zbMATH DE number 4173001

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Computer programming as an art
• Optimal disk merge patterns

Cited in

(12)

• Functions of binary trees and their applications in algorithm complexity analysis
• Binary trees and uniform distribution of traffic cutback
• scientific article; zbMATH DE number 4096779 (Why is no real title available?)
• scientific article; zbMATH DE number 4173001 (Why is no real title available?)
• Optimality of right leaning trees
• scientific article; zbMATH DE number 3881889 (Why is no real title available?)
• Assigning bookmarks in perfect binary trees.
• Ranking the Best Binary Trees
• scientific article; zbMATH DE number 4122014 (Why is no real title available?)
• scientific article; zbMATH DE number 176528 (Why is no real title available?)
• EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
• Lopsided trees. I: Analyses

This page was built for publication: Extremal properties of ?-weighted binary trees

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