{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:25Z","timestamp":1725560785144},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"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-14553-7_13","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T03:59:21Z","timestamp":1280116761000},"page":"113-123","source":"Crossref","is-referenced-by-count":2,"title":["Constant Time Generation of Biconnected 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":"13_CR1","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 Journal on Computing\u00a09, 706\u2013712 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR2","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"},{"key":"13_CR3","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":"13_CR4","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1021\/ci00014a012","volume":"33","author":"L.H. Hall","year":"1993","unstructured":"Hall, L.H., Dailey, E.S.: Design of molecules from quantitative structure-activity relationship models. 3. role of higher order path counts: path 3. J. Chem. Inf. Comp. Sci.\u00a033, 598\u2013603 (1993)","journal-title":"J. Chem. Inf. Comp. Sci."},{"key":"13_CR5","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":"13_CR6","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":"13_CR7","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":"#cr-split#-13_CR8.1","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);","DOI":"10.1142\/9781848163324_0005"},{"key":"#cr-split#-13_CR8.2","unstructured":"Genome Informatics 21, 53-64 (2008)"},{"key":"13_CR9","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":"13_CR10","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":"13_CR11","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":"13_CR12","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1021\/ci6003652","volume":"47","author":"H. Mauser","year":"2007","unstructured":"Mauser, H., Stahl, M.: Chemical fragment spaces for de novo design. J. Chem. Inf. Comp. Sci.\u00a047, 318\u2013324 (2007)","journal-title":"J. Chem. Inf. Comp. Sci."},{"key":"13_CR13","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":"13_CR14","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"},{"issue":"2","key":"13_CR15","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":"13_CR16","unstructured":"Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)"},{"key":"13_CR17","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":"13_CR18","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":"13_CR19","doi-asserted-by":"publisher","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":"13_CR20","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":"13_CR21","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":"13_CR22","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), http:\/\/www-or.amp.i.kyoto-u.ac.jp\/members\/nag\/Technical~report\/TR2009-018.pdf"},{"key":"13_CR23","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), http:\/\/www-or.amp.i.kyoto-u.ac.jp\/members\/nag\/Technical~report\/TR2010-001.pdf"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:30:32Z","timestamp":1559305832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}