{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T07:49:55Z","timestamp":1778053795455,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175169","type":"print"},{"value":"9783642175176","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_18","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:13:41Z","timestamp":1291407221000},"page":"182-193","source":"Crossref","is-referenced-by-count":1,"title":["Generating Trees on Multisets"],"prefix":"10.1007","author":[{"given":"Bingbing","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"257","volume":"45","author":"A. Cayley","year":"1875","unstructured":"Cayley, A.: On the analytic forms called trees with applications to the theory of chemical combinations. Rep. Brit. Assoc. Adv. Sci.\u00a045, 257\u2013305 (1875)","journal-title":"Rep. Brit. Assoc. Adv. Sci."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01164196","volume":"11","author":"T.S. Balaban","year":"1992","unstructured":"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.\u00a011, 79\u2013105 (1992)","journal-title":"J. Math. Chem."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Computing\u00a09, 706\u2013712 (1980)","journal-title":"SIAM J. Computing"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1021\/ci700385a","volume":"48","author":"H. Fujiwara","year":"2008","unstructured":"Fujiwara, H., Wang, J., Zhao, L., Nagamochi, H., Akutsu, T.: Enumerating tree-like chemical graphs with given path frequency. J. Chem. Inf. Mod.\u00a048, 1345\u20131357 (2008)","journal-title":"J. Chem. Inf. Mod."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-10631-6_4","volume-title":"Algorithms and Computation","author":"T. Imada","year":"2009","unstructured":"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.\u00a05878, pp. 14\u201323. Springer, Heidelberg (2009)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"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.\u00a021, pp. 53\u201364 (2008)","DOI":"10.1142\/9781848163324_0005"},{"key":"18_CR7","first-page":"939","volume":"1999","author":"G. Li","year":"1999","unstructured":"Li, G., Ruskey, F.: The advantage of forward thinking in generating rooted and free trees. In: SODA 1999, pp. 939\u2013940 (1999)","journal-title":"SODA"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. of Algorithms\u00a026, 306\u2013324 (1998)","journal-title":"J. of Algorithms"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.comgeo.2003.06.001","volume":"27","author":"S. Nakano","year":"2004","unstructured":"Nakano, S.: Efficient generation of triconnected plane triangulations. Computational Geometry Theory and Applications\u00a027(2), 109\u2013122 (2004)","journal-title":"Computational Geometry Theory and Applications"},{"key":"18_CR10","unstructured":"Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 33\u201345. Springer, Heidelberg (2004)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11604686_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Nakano","year":"2005","unstructured":"Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 249\u2013260. Springer, Heidelberg (2005)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"R.A. Wright","year":"1986","unstructured":"Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant time generation of free trees. SIAM J. Comput.\u00a015, 540\u2013548 (1986)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","unstructured":"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"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-13073-1_6","volume-title":"Algorithms and Complexity","author":"B. Zhuang","year":"2010","unstructured":"Zhuang, B., Nagamochi, H.: Enumerating rooted graphs with reflectional block structures. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 49\u201360. Springer, Heidelberg (2010)"},{"key":"18_CR16","unstructured":"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"},{"key":"18_CR17","unstructured":"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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T19:49:31Z","timestamp":1559850571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}