{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:23:39Z","timestamp":1725557019548},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_42","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"467-478","source":"Crossref","is-referenced-by-count":2,"title":["Generating Internally 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":"42_CR1","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)","DOI":"10.1145\/800119.803896"},{"key":"42_CR2","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)","DOI":"10.1145\/1150402.1150427"},{"key":"42_CR3","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)"},{"issue":"2","key":"42_CR4","doi-asserted-by":"crossref","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":"42_CR5","first-page":"43","volume-title":"Progress in Graph Theory","author":"C. Thomassen","year":"1984","unstructured":"Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43\u201369. Academic Press, London (1984)"},{"issue":"3","key":"42_CR6","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":"42_CR7","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)"},{"key":"42_CR8","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":"42_CR9","unstructured":"Zhuang, B., Nagamochi, H.: Efficient generation of symmetric and asymmetric biconnected rooted outerplanar graphs. In: The 3rd Annual Meeting of Asian Association for Algorithms and Computation (AAAC), POSTECH, Pohang, Korea, April 17-19 (to appear, 2010)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Zhuang, B., Nagamochi, H.: Enumerating biconnected rooted plane graphs, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2010-001 (2010)","DOI":"10.1007\/978-3-642-14553-7_13"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Zhuang, B., Nagamochi, H.: Listing triconnected rooted plane graphs, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2010-002 (2010)","DOI":"10.1007\/978-3-642-17461-2_28"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Zhuang, B., Nagamochi, H.: Generating internally triconnected rooted plane graphs, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2010-003 (2010)","DOI":"10.1007\/978-3-642-13562-0_42"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:07Z","timestamp":1606185607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}