{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:15:12Z","timestamp":1761862512342},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_22","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"249-260","source":"Crossref","is-referenced-by-count":21,"title":["Generating Colored Trees"],"prefix":"10.1007","author":[{"given":"Shin-ichi","family":"Nakano","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Foundations of Computer Science","author":"A.V. Aho","year":"1995","unstructured":"Aho, A.V., Ullman, J.D.: Foundations of Computer Science. Computer Science Press, New York (1995)"},{"key":"22_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering Frequent Substructures in Large Unordered Trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"key":"22_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. Comput.\u00a09, 706\u2013712 (1980)","journal-title":"SIAM J. Comput."},{"key":"22_CR4","unstructured":"Chi, Y., Nijsseny, S., Muntz, R.R., Kok, J.N.: Frequent Subtree Mining\u2013An Overview. Fundamenta Informaticae, Special Issue on Graph and Tree Mining (2005) (to appear)"},{"key":"22_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient Algorithms for Listing Combinatorial Structures","author":"L.A. Goldberg","year":"1993","unstructured":"Goldberg, L.A.: Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, New York (1993)"},{"key":"22_CR6","volume-title":"Combinatorial Algorithms","author":"D.L. Kreher","year":"1998","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms. CRC Press, Boca Raton (1998)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-48224-5_36","volume-title":"Automata, Languages and Programming","author":"Z. Li","year":"2001","unstructured":"Li, Z., Nakano, S.: Efficient Generation of Plane Triangulations without Repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 433\u2013443. Springer, Heidelberg (2001)"},{"key":"22_CR8","unstructured":"Li, G., Ruskey, F.: The Advantage of Forward Thinking in Generating Rooted and Free Trees. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 939\u2013940 (1999)"},{"key":"22_CR9","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"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0190(02)00240-5","volume":"84","author":"S. Nakano","year":"2002","unstructured":"Nakano, S.: Efficient Generation of Plane Trees. Information Processing Letters\u00a084, 167\u2013172 (2002)","journal-title":"Information Processing Letters"},{"key":"22_CR11","unstructured":"Nakano, S., Uno, T.: Efficient Generation of Rooted Trees, NII Technical Report, NII-2003-005E (2003), \n                    \n                      http:\/\/research.nii.ac.jp\/TechReports\/03-005E.html"},{"key":"22_CR12","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":"22_CR13","unstructured":"Ruskey, F., Sawada, J.: A Fast Algorithm to Generate Unlabeled Necklaces. In: Proc. of SODA 2000, pp. 256\u2013262 (2000)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R.C. Read","year":"1978","unstructured":"Read, R.C.: How to Avoid Isomorphism Search When Cataloguing Combinatorial Configurations. Annals of Discrete Mathematics\u00a02, 107\u2013120 (1978)","journal-title":"Annals of Discrete Mathematics"},{"key":"22_CR15","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, NJ (2001)","edition":"2"},{"key":"22_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970166","volume-title":"Combinatorial Algorithms : An Update","author":"H.S. Wilf","year":"1989","unstructured":"Wilf, H.S.: Combinatorial Algorithms: An Update. SIAM, Philadelphia (1989)"},{"key":"22_CR17","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."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:22Z","timestamp":1619507062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11604686_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}