Performances of an algorithm constructing a nearly optimal binary tree

DOI10.1007/BF00289410zbMath0523.68055MaRDI QIDQ1056546

Herman Akdag

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

algorithmminimization of the path lengthnearly optimal binary tree

Mathematics Subject Classification ID

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

Related Items (1)

Optimal binary search trees

Cites Work

• A Mathematical Theory of Communication
• Nearly optimal binary search trees
• Performance bounds on the splitting algorithm for binary testing
• Identification Keys and Diagnostic Tables: A Review
• Simple Binary Identification Problems
• Unnamed Item

This page was built for publication: Performances of an algorithm constructing a nearly optimal binary tree