{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:55:11Z","timestamp":1725555311286},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"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-13073-1_6","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T08:09:58Z","timestamp":1273478998000},"page":"49-60","source":"Crossref","is-referenced-by-count":5,"title":["Enumerating Rooted Graphs with Reflectional Block Structures"],"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":"6_CR1","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. Journal of Chemical Information and Modeling\u00a048, 1345\u20131357 (2008)","journal-title":"Journal of Chemical Information and Modeling"},{"doi-asserted-by":"crossref","unstructured":"Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T.: Improved algorithm for enumerating tree-like chemical graphs. In: The 19th International Conference on Genome Informatics, Gold Coast, Australia, December 1-3 (2008);","key":"#cr-split#-6_CR2.1","DOI":"10.1142\/9781848163324_0005"},{"unstructured":"Genome Informatics 21, 53-64 (2008)","key":"#cr-split#-6_CR2.2"},{"unstructured":"Li, G., Ruskey, F.: The advantage of forward thinking in generating rooted and free trees. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 939\u2013940 (1999)","key":"6_CR3"},{"unstructured":"Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)","key":"6_CR4"},{"key":"6_CR5","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)"},{"unstructured":"Zhuang, B., Nagamochi, H.: Enumerating rooted biconnected planar graphs with internally triangulated faces, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2009-018 (2009)","key":"6_CR6"},{"doi-asserted-by":"crossref","unstructured":"Zhuang, B., Nagamochi, H.: Enumerating rooted graphs with reflectional block structures, Dept. of Applied Mathematics and Physics, Kyoto University, Technical Report 2009-019 (2009)","key":"6_CR7","DOI":"10.1007\/978-3-642-13073-1_6"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T13:20:36Z","timestamp":1635340836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}