References

  1. A. Ahmadi-Adl, A. Nowzari-Dalini & H. Ahrabian (2011): Ranking and unranking algorithms for loopless generation of t-ary trees. Logic Journal of IGPL 19(1), pp. 33–43, doi:10.1093/jigpal/jzp097.
  2. H. Ahrabian & A. Nowzari-Dalini (1998): On the generation of binary trees from (0–1) codes. International journal of computer mathematics 69(3-4), pp. 243–251, doi:10.1080/00207169808804721.
  3. H. Ahrabian & A. Nowzari-Dalini (1999): On the generation of binary trees in A-order. International journal of computer mathematics 71(3), pp. 351–357, doi:10.1080/00207169908804813.
  4. H. Ahrabian & A. Nowzari-Dalini (2005): Parallel generation of binary trees in A-order. Parallel Computing 31(8), pp. 948–955, doi:10.1016/j.parco.2005.06.002.
  5. R. Aringhieri, P. Hansen & F. Malucelli (2003): Chemical trees enumeration algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research Societies 1(1), pp. 67–83, doi:10.1007/s10288-002-0008-9.
  6. T. S. Balaban, P. A. Filip & O. Ivanciuc (1992): Computer generation of acyclic graphs based on local vertex invariants and topological indices. Derived canonical labelling and coding of trees and alkanes. Journal of Mathematical Chemistry 11(1), pp. 79–105, doi:10.1007/BF01164196.
  7. T. Beyer & S. M. Hedetniemi (1980): Constant time generation of rooted trees. SIAM Journal on Computing 9(4), pp. 706–712, doi:10.1137/0209055.
  8. G. Caporossi, I. Gutman & P. Hansen (1999): Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index. Computers & Chemistry 23(5), pp. 469–477, doi:10.1016/S0097-8485(99)00031-5.
  9. A. A. Dobrynin & I. Gutman (1999): The Average Wiener Index of Trees and Chemical Trees. Journal of Chemical Information and Computer Sciences 39(4), pp. 679–683, doi:10.1021/ci980158r.
  10. M. C. Er (1992): Efficient generation of k-ary trees in natural order. The Computer Journal 35(3), pp. 306–308, doi:10.1093/comjnl/35.3.306.
  11. H. Fujiwara, J. Wang, L. Zhao, H. Nagamochi & T. Akutsu (2008): Enumerating Treelike Chemical Graphs with Given Path Frequency. Journal of Chemical Information and Modeling 48(7), pp. 1345–1357, doi:10.1021/ci700385a.
  12. I. Gutman (1987): Graphs and graph polynomials of interest in chemistry, pp. 177–187. Springer Berlin Heidelberg, doi:10.1007/3-540-17218-1.
  13. I. Gutman, P. Hansen & H. Mélot (2005): Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. Journal of Chemical Information and Modeling 45(2), pp. 222–230, doi:10.1021/ci0342775.
  14. I. Gutman & O. E. Polansky (1986): Mathematical concepts in organic chemistry. Springer Berlin Heidelberg, doi:10.1007/978-3-642-70982-1.
  15. P. Hansen, B. Jaumard, C. Lebatteux & M. Zheng (1994): Coding Chemical Trees with the Centered N-tuple Code. Journal of Chemical Information and Computer Sciences 34(4), pp. 782–790, doi:10.1021/ci00020a010.
  16. J. B. Hendrickson & C. A. Parks (1991): Generation and enumeration of carbon skeletons. Journal of Chemical Information and Computer Sciences 31(1), pp. 101–107, doi:10.1021/ci00001a018.
  17. S. Heubach, N. Y. Li & T. Mansour (2008): Staircase tilings and k-Catalan structures. Discrete Mathematics 308(24), pp. 5954–5964, doi:10.1016/j.disc.2007.11.012.
  18. J. F Korsh (2005): Generating t-ary trees in linked representation. The Computer Journal 48(4), pp. 488–497, doi:10.1093/comjnl/bxh110.
  19. J. F. Korsh & P. LaFollette (1999): Loopless generation of Gray codes for k-ary trees. Information processing letters 70(1), pp. 7–11, doi:10.1016/S0020-0190(99)00035-6.
  20. M. Lepovic & I. Gutman (1998): A collective property of trees and chemical trees. Journal of chemical information and computer sciences 38(5), pp. 823–826, doi:10.1021/ci980004b.
  21. L. Li (1986): Ranking and unranking of AVL-trees. SIAM Journal on Computing 15(4), pp. 1025–1035, doi:10.1137/0215073.
  22. J. M. Lucas, D. R. Vanbaronaigien & F. Ruskey (1993): On rotations and the generation of binary trees. Journal of Algorithms 15(3), pp. 343–366, doi:10.1006/jagm.1993.1045.
  23. S. Nakano & T. Uno (2005): Constant time generation of trees with specified diameter. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, pp. 33–45, doi:10.1007/978-3-540-30559-03.
  24. J. M. Pallo (1987): Generating trees with n nodes and m leaves. International journal of computer mathematics 21(2), pp. 133–144, doi:10.1080/00207168708803562.
  25. J. M. Pallo (1990): A simple algorithm for generating neuronal dendritic trees. Computer methods and programs in biomedicine 33(3), pp. 165–169, doi:10.1016/0169-2607(90)90038-B.
  26. J. M. Pallo & R. Racca (1985): A note on generating binary trees in A-order and B-order. International Journal of Computer Mathematics 18(1), pp. 27–39, doi:10.1080/00207168508803477.
  27. F. Ruskey (1978): Generating t-ary trees lexicographically. SIAM Journal on Computing 7(4), pp. 424–439, doi:10.1137/0207034.
  28. E. Seyedi-Tabari, H. Ahrabian & A. Nowzari-Dalini (2010): A new algorithm for generation of different types of RNA. International Journal of Computer Mathematics 87(6), pp. 1197–1207, doi:10.1080/00207160802140049.
  29. M. Shimizu, H. Nagamochi & T. Akutsu (2011): Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC Bioinformatics 12(14), pp. 1–9, doi:10.1186/1471-2105-12-S14-S3.
  30. V. Vajnovszki & J. M. Pallo (1994): Generating binary trees in A-order from codewords defined on a four-letter alphabet. Journal of Information and Optimization Sciences 15(3), pp. 345–357, doi:10.1080/02522667.1994.10699193.
  31. V. Vajnovszki & J. M. Pallo (1997): Ranking and unranking k-ary trees with a 4 k-4 letter alphabet. Journal of Information and Optimization Sciences 18(2), pp. 271–279, doi:10.1080/02522667.1997.10699333.
  32. H. S. Wilf & N. A. Yoshimura (1989): Ranking rooted trees, and a graceful application. Annals of the New York Academy of Sciences 576(1), pp. 633–640, doi:10.1111/j.1749-6632.1989.tb16444.x.
  33. P. Willett, J. M. Barnard & G. M. Downs (1998): Chemical similarity searching. Journal of chemical information and computer sciences 38(6), pp. 983–996, doi:10.1021/ci9800211.
  34. R. A. Wright, B. Richmond, A. Odlyzko & B. D. McKay (1986): Constant time generation of free trees. SIAM Journal on Computing 15(2), pp. 540–548, doi:10.1137/0215039.
  35. R. Wu, J. Chang & C. Chang (2011): Ranking and unranking of non-regular trees with a prescribed branching sequence. Mathematical and Computer Modelling 53(5), pp. 1331–1335, doi:10.1016/j.mcm.2010.12.019.
  36. R. Wu, J. Chang & Y. Wang (2006): A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theoretical Computer Science 355(3), pp. 303–314, doi:10.1016/j.tcs.2006.01.022.
  37. L. Xiang, K. Ushijima & C. Tang (2001): On generating k-ary trees in computer representation. Information processing letters 77(5), pp. 231–238, doi:10.1016/S0020-0190(00)00155-1.
  38. K. Yamanaka, Y. Otachi & S. Nakano (2009): Efficient enumeration of ordered trees with k leaves. In: WALCOM: Algorithms and Computation. Springer, pp. 141–150, doi:10.1016/j.tcs.2011.01.017.
  39. S. Zaks (1980): Lexicographic generation of ordered trees. Theoretical Computer Science 10(1), pp. 63–82, doi:10.1016/0304-3975(80)90073-0.
  40. B. Zhuang & H. Nagamochi (2010): Constant Time Generation of Trees with Degree Bounds. In: 9th International Symposium on Operations Research and Its Applications, pp. 183–194, doi:10.1.1.385.6436.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org