{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:20:18Z","timestamp":1725571218325},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"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-17461-2_28","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T09:53:59Z","timestamp":1292406839000},"page":"347-361","source":"Crossref","is-referenced-by-count":1,"title":["Listing Triconnected Rooted Plane Graphs"],"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":"28_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":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: STOC 1974, pp. 172\u2013184 (1974)","key":"28_CR2","DOI":"10.1145\/800119.803896"},{"doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proc. 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 197\u2013206 (2006)","key":"28_CR3","DOI":"10.1145\/1150402.1150427"},{"key":"28_CR4","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)"},{"doi-asserted-by":"crossref","unstructured":"Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T.: Improved algorithm for enumerating tree-like chemical graphs. In: Genome Informatics, GIW 2008, vol.\u00a021, pp. 53\u201364 (2008)","key":"28_CR5","DOI":"10.1142\/9781848163324_0005"},{"key":"28_CR6","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":"28_CR7","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. IPL\u00a084, 167\u2013172 (2002)","journal-title":"IPL"},{"doi-asserted-by":"crossref","unstructured":"Nakano, S.: Efficient generation of triconnected plane triangulations. In: Computational Geometry Theory and Applications, vol.\u00a027(2), pp. 109\u2013122 (2004)","key":"28_CR8","DOI":"10.1016\/j.comgeo.2003.06.001"},{"unstructured":"Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)","key":"28_CR9"},{"key":"28_CR10","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"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. of London Math. Soc.\u00a010(3), 304\u2013320 (1960)","journal-title":"Proc. of London Math. Soc."},{"key":"28_CR12","first-page":"1","volume":"3AB12","author":"E. Steinitz","year":"1922","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. Encyclop\u00e4die der mathematischen Wissenschaften, Band 3 (Geometrie), Teil\u00a03AB12, 1\u2013139 (1922)","journal-title":"Encyclop\u00e4die der mathematischen Wissenschaften, Band 3 (Geometrie), Teil"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-77891-2_20","volume-title":"WALCOM: Algorithms and Computation","author":"K. Yamanaka","year":"2008","unstructured":"Yamanaka, K., Nakano, S.: Listing all plane graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol.\u00a04921, pp. 210\u2013221. Springer, Heidelberg (2008)"},{"unstructured":"Zhuang, B., Nagamochi, H.: Enumerating rooted biconnected planar graphs with internally triangulated faces, Kyoto University, Technical Report 2009-018 (2009), http:\/\/www-or.amp.i.kyoto-u.ac.jp\/members\/nag\/Technical_report\/TR2009-018.pdf","key":"28_CR14"},{"unstructured":"Zhuang, B., Nagamochi, H.: Efficient generation of symmetric and asymmetric biconnected rooted outerplanar graphs. In: AAAC 2010, p. 21 (2010)","key":"28_CR15"},{"unstructured":"Zhuang, B., Nagamochi, H.: Enumerating biconnected rooted plane graphs, Kyoto University, Technical Report 2010-001 (2010), http:\/\/www-or.amp.i.kyoto-u.ac.jp\/members\/nag\/Technical_report\/TR2010-001.pdf","key":"28_CR16"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-14553-7_13","volume-title":"Frontiers in Algorithmics","author":"B. Zhuang","year":"2010","unstructured":"Zhuang, B., Nagamochi, H.: Constant time generation of biconnected rooted plane graphs. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 113\u2013123. Springer, Heidelberg (2010)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-642-13073-1_6","volume-title":"CIAC 2010","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":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/978-3-642-13562-0_42","volume-title":"TAMC 2010","author":"B. Zhuang","year":"2010","unstructured":"Zhuang, B., Nagamochi, H.: Generating internally triconnected rooted plane graphs. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 467\u2013478. Springer, Heidelberg (2010)"},{"unstructured":"Zhuang, B., Nagamochi, H.: Listing triconnected rooted plane graphs, Kyoto University, Technical Report 2010-002 (2010), http:\/\/www-or.amp.i.kyoto-u.ac.jp\/members\/nag\/Technical_report\/TR2010-002.pdf","key":"28_CR20"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T02:55:08Z","timestamp":1559876108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}