Generating trees on multisets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6506 LNCS, Issue PART 1, 2010, Pages 182-193

  Zhuang, Bingbing ^a   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL GRAPHS; MULTI-SETS; MULTISET; PREPROCESSING TIME; WORST CASE;

ALGORITHMS; ISOMERS; FORESTRY;

TREES (MATHEMATICS);

EID: 78650867497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17517-6_18     Document Type: Conference Paper

References (17)

1. Cayley, A.: On the analytic forms called trees with applications to the theory of chemical combinations. Rep. Brit. Assoc. Adv. Sci. 45, 257-305 (1875)
2. Balaban, T.S., Filip, P.A., Ivanciuc, O.: Computer generation of acyclic graphs based on local vertex invariants and topological indices, derived canonical labeling and coding of trees and alkanes. J. Math. Chem. 11, 79-105 (1992)
3. Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Computing 9, 706-712 (1980)
4. Fujiwara, H., Wang, J., Zhao, L., Nagamochi, H., Akutsu, T.: Enumerating tree-like chemical graphs with given path frequency. J. Chem. Inf. Mod. 48, 1345-1357 (2008)
5. Imada, T., Ota, S., Nagamochi, H., Akutsu, T.: Enumerating stereoisomers of tree structured molecules using dynamic programming. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 14-23. Springer, Heidelberg (2009)
6. Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T.: Improved algorithm for enumerating tree-like chemical graphs. In: Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T. (eds.) GIW 2008. Genome Informatics, vol. 21, pp. 53-64 (2008)
7. Li, G., Ruskey, F.: The advantage of forward thinking in generating rooted and free trees. In: SODA 1999, pp. 939-940 (1999)
8. McKay, B.D.: Isomorph-free exhaustive generation. J. of Algorithms 26, 306-324 (1998)
9. Nakano, S.: Efficient generation of triconnected plane triangulations. Computational Geometry Theory and Applications 27(2), 109-122 (2004)
10. Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)
11. Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33-45. Springer, Heidelberg (2004)
12. Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 249-260. Springer, Heidelberg (2005)
13. Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput. 15, 540-548 (1986)
14. Zhuang, B., Nagamochi, H.: Enumerating rooted graphs with reflectional block structures, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2009-019 (2009), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical-report/TR2009-019.pdf
15. Zhuang, B., Nagamochi, H.: Enumerating rooted graphs with reflectional block structures. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 49-60. Springer, Heidelberg (2010)
16. Zhuang, B., Nagamochi, H.: Constant time generation of trees with degree bounds, Dept. of Applied Mathematics and Physics, Kyoto University, Technical Report 2010-006 (2010), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical- report/TR2010-006.pdf
17. Zhuang, B., Nagamochi, H.: Generating Trees on Multisets, Dept. of Applied Mathematics and Physics, Kyoto University, Technical Report 2010-009 (2010), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical-report/TR2010- 009.pdf