Extremal properties of ?-weighted binary trees

DOI10.1007/BF01078899zbMATH Open0666.68066OpenAlexW2066449094MaRDI QIDQ3817628FDOQ3817628

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer programming as an art
• Optimal disk merge patterns

Cited In (12)

• Optimality of right leaning trees
• Ranking the Best Binary Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lopsided trees. I: Analyses
• Functions of binary trees and their applications in algorithm complexity analysis
• Binary trees and uniform distribution of traffic cutback
• Title not available (Why is that?)
• EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
• Title not available (Why is that?)
• Title not available (Why is that?)
• Assigning bookmarks in perfect binary trees.

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)