Extremal properties of ?-weighted binary trees

DOI10.1007/BF01078899zbMATH Open0666.68066OpenAlexW2066449094MaRDI QIDQ3817628FDOQ3817628

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)

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 (4)

• Title not available (Why is that?)
• Lopsided trees. I: Analyses
• EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Ranking the Best Binary Trees 👍 👎
• Alphabetic Minimax Trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)