Decision trees with minimum average depth for sorting eight elements

DOI10.1016/j.dam.2015.10.030zbMath1333.05072OpenAlexW2180391894MaRDI QIDQ266840

Hassan AbouEisha, Igor Chikalov, Mikhail Ju. Moshkov

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.030

zbMATH Keywords

sortingdecision treeaverage depth

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Bi-criteria optimization of decision trees with applications to data analysis

Uses Software

• DAGGER

Cites Work

• Unnamed Item
• Unnamed Item
• Average time complexity of decision trees.
• New results in minimum-comparison sorting
• Transactions on Rough Sets III
• Optimal Binary Identification Procedures

This page was built for publication: Decision trees with minimum average depth for sorting eight elements