25
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

On the listing and random generation of hybrid binary trees

Pages 135-145 | Published online: 19 Mar 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Walter J. Gutjahr & Ch. E. Wö Ber. (1997) An improved algorithm for finding minimum-risk 3-state-device networks. International Journal of Computer Mathematics 64:1-2, pages 59-72.
Read now

Articles from other publishers (6)

Lin Yang, Feng-Yun Ren & Sheng-Liang Yang. (2022) Some refined enumerations of hybrid binary trees. Indian Journal of Pure and Applied Mathematics.
Crossref
SeoungJi Hong & SeungKyung Park. (2014) HYBRID d-ARY TREES AND THEIR GENERALIZATION. Bulletin of the Korean Mathematical Society 51:1, pages 229-235.
Crossref
Alois Panholzer & Helmut Prodinger. (2009) Bijections between certain families of labelled and unlabelled d-ary trees. Applicable Analysis and Discrete Mathematics 3:1, pages 123-136.
Crossref
Nancy S.S. Gu, Nelson Y. Li & Toufik Mansour. (2008) 2-Binary trees: Bijections and related issues. Discrete Mathematics 308:7, pages 1209-1221.
Crossref
Vincent Vajnovszki. 2001. Combinatorics, Computability and Logic. Combinatorics, Computability and Logic 227 240 .
Erkki Mäkinen. (1999) Generating random binary trees — A survey. Information Sciences 115:1-4, pages 123-136.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.