{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:53:50Z","timestamp":1742925230327,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_43","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"505-516","source":"Crossref","is-referenced-by-count":3,"title":["Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Nils","family":"Kriege","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals\u00a0E76-A(9) (1993)"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-35261-4_18","volume-title":"Algorithms and Computation","author":"T. Akutsu","year":"2012","unstructured":"Akutsu, T., Tamura, T.: On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 146\u2013155. Springer, Heidelberg (2012)"},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3390\/a6010119","volume":"6","author":"T. Akutsu","year":"2013","unstructured":"Akutsu, T., Tamura, T.: A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree. Algorithms\u00a06(1), 119\u2013135 (2013)","journal-title":"Algorithms"},{"issue":"2","key":"43_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.7155\/jgaa.00090","volume":"8","author":"S. Bachl","year":"2004","unstructured":"Bachl, S., Brandenburg, F.J., Gmach, D.: Computing and drawing isomorphic subgraphs. J. Graph Algorithms Appl.\u00a08(2), 215\u2013238 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s004530010023","volume":"27","author":"A. Dessmark","year":"2000","unstructured":"Dessmark, A., Lingas, A., Proskurowski, A.: Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Algorithmica\u00a027, 337\u2013347 (2000)","journal-title":"Algorithmica"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-58218-5_16","volume-title":"Algorithm Theory - SWAT \u201994","author":"A. Gupta","year":"1994","unstructured":"Gupta, A., Nishimura, N.: Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol.\u00a0824, pp. 172\u2013182. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(96)00046-1","volume":"164","author":"A. Gupta","year":"1996","unstructured":"Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science\u00a0164(1-2), 287\u2013298 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"43_CR8","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.jcss.2007.01.003","volume":"73","author":"M. Hajiaghayi","year":"2007","unstructured":"Hajiaghayi, M., Nishimura, N.: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. System Sci.\u00a073(5), 755 (2007)","journal-title":"J. Comput. System Sci."},{"issue":"1-3","key":"43_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics\u00a0108(1-3), 343\u2013364 (1992)","journal-title":"Discrete Mathematics"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Matula, D.W.: Subtree isomorphism in O(n\n                           5\/2). In: Algorithmic Aspects of Combinatorics. Ann. Discrete Math., vol.\u00a02, p. 91 (1978)","DOI":"10.1016\/S0167-5060(08)70324-8"},{"key":"43_CR11","unstructured":"Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time metric for outerplanar graphs. In: Mining and Learning with Graphs, MLG 2007, Firence, Italy, August 1-3 (2007)"},{"issue":"1","key":"43_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","volume":"17","author":"M.M. Sys\u0142o","year":"1982","unstructured":"Sys\u0142o, M.M.: The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science\u00a017(1), 91\u201397 (1982)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ipl.2004.06.019","volume":"92","author":"A. Yamaguchi","year":"2004","unstructured":"Yamaguchi, A., Aoki, K.F., Mamitsuka, H.: Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. Inf. Process. Lett.\u00a092(2), 57\u201363 (2004)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:50:40Z","timestamp":1676886640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}