Random generation of trees and other combinatorial objects

Author： Barcucci E. Del Lungo A. Pergola E.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.218, Iss.2, 1999-05, pp. : 219-232

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exhaustive generation of combinatorial objects by ECO

By Bacchelli Silvia Barcucci Elena Grazzini Elisabetta Pergola Elisa

Acta Informatica, Vol. 40, Iss. 8, 2004-07 ,pp. : 585-602

Springer Publishing Company

Access to resources Recommend Favorite

Inferring evolutionary trees with strong combinatorial evidence

By Berry

Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. : 271-298

Elsevier

Access to resources Recommend Favorite

Distances in random digital search trees

By Aguech Rafik Lasmar Nabil Mahmoud Hosam

Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. : 243-264

Springer Publishing Company

Access to resources Recommend Favorite

Biased random-key genetic algorithms for combinatorial optimization

By Gonçalves José

Journal of Heuristics, Vol. 17, Iss. 5, 2011-10 ,pp. : 487-525

Springer Publishing Company

Access to resources Recommend Favorite

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

By Fuchs Michael Hwang Hsien-Kuei Neininger Ralph

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 367-407

Springer Publishing Company

Access to resources Recommend Favorite