1. Esmeir, S., Markovitch, S.: Anytime learning of decision trees. Journal of Machine Learning Research 8, 891–933 (2007)
2. Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5(1), 15–17 (1976)
3. Lecture Notes in Computer Science;G. Katsirelos,2007
4. Prosser, P., Unsworth, C.: Rooted tree and spanning tree constraints. In: Workshop on Modelling and Solving Problems with Constraints, held at ECAI 2006 (2006)
5. Quinlan, J.R.: Induction of decision trees. Machine Learning 1(1), 81–106 (1986)