Alphabetic Minimax Trees of Degree at Most t
From MaRDI portal
Publication:3715026
DOI10.1137/0215013zbMath0587.94019OpenAlexW2137071342MaRDI QIDQ3715026
No author found.
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1134&context=hmc_fac_pub
logical circuitsminimax treeoptimal weighted treecircuit fan-out reductionefficient construction algorithmmaximum weighted path length
Related Items (3)
Operations research applications of dichotomous search ⋮ Minimax trees in linear time with applications ⋮ Optimal binary search trees
This page was built for publication: Alphabetic Minimax Trees of Degree at Most t