Abstract
Given a multiset M = V 1 ∪ V 2 ∪ ⋯ ∪ V C of n elements and a capacity function Δ: [1,C]→[2,n − 1], we consider the problem of enumerating all unrooted trees T on M such that the degree of each vertex v ∈ V i is bounded from above by Δ(i). The problem has a direct application of enumerating isomers of tree-like chemical graphs. We give an algorithm that generates all such trees without duplication in O(1)-time delay per output in the worst case using O(n) space, with O(n) initial preprocessing time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Computing 9, 706–712 (1980)
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)
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)
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)
Li, G., Ruskey, F.: The advantage of forward thinking in generating rooted and free trees. In: SODA 1999, pp. 939–940 (1999)
McKay, B.D.: Isomorph-free exhaustive generation. J. of Algorithms 26, 306–324 (1998)
Nakano, S.: Efficient generation of triconnected plane triangulations. Computational Geometry Theory and Applications 27(2), 109–122 (2004)
Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)
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)
Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 249–260. Springer, Heidelberg (2005)
Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput. 15, 540–548 (1986)
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
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)
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
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhuang, B., Nagamochi, H. (2010). Generating Trees on Multisets. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)