{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:25:49Z","timestamp":1761863149948},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_10","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"76-87","source":"Crossref","is-referenced-by-count":6,"title":["A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Takeyuki","family":"Tamura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Samatova, N.F., Rizk, M.A., Langston, M.A.: The maximum common subgraph problem: faster solutions via vertex cover. In: Proc. 2007 IEEE\/ACS Int. Conf. Computer Systems and Applications, pp. 367\u2013373. IEEE (2007)","DOI":"10.1109\/AICCSA.2007.370907"},{"key":"10_CR2","first-page":"1488","volume":"E76-A","author":"T. Akutsu","year":"1993","unstructured":"Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals\u00a0E76-A, 1488\u20131493 (1993)","journal-title":"IEICE Trans. Fundamentals"},{"key":"10_CR3","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 and Applications\u00a08, 215\u2013238 (2004)","journal-title":"J. Graph Algorithms and Applications"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognition and Artificial Intelligence\u00a018, 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognition and Artificial Intelligence"},{"key":"10_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":"10_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"10_CR7","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. Syst. Sci.\u00a073, 755\u2013768 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proc. 12th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp. 197\u2013206. ACM (2006)","DOI":"10.1145\/1150402.1150427"},{"issue":"4","key":"10_CR9","first-page":"S","volume":"7","author":"X. Huang","year":"2006","unstructured":"Huang, X., Lai, J., Jennings, S.F.: Maximum common subgraph: some upper bound and lower bound results. BMC Bioinformatics 7(suppl. 4), S-4 (2006)","journal-title":"BMC Bioinformatics"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-55210-3_198","volume-title":"STACS 92","author":"V. Kann","year":"1992","unstructured":"Kann, V.: On the Approximability of the Maximum Common Subgraph Problem. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 377\u2013388. Springer, Heidelberg (1992)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0304-3975(89)90011-X","volume":"63","author":"A. Lingas","year":"1989","unstructured":"Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoret. Comput. Sci.\u00a063, 295\u2013302 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Computer-Aided Molecular Design\u00a016, 521\u2013533 (2002)","journal-title":"J. Computer-Aided Molecular Design"},{"key":"10_CR13","unstructured":"Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time metric for outerplanar graphs. In: Proc. Workshop on Mining and Learning with Graphs (2007)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/S0031-3203(00)00048-0","volume":"34","author":"K. Shearer","year":"2001","unstructured":"Shearer, K., Bunke, H., Venkatesh, S.: Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition\u00a034, 1075\u20131091 (2001)","journal-title":"Pattern Recognition"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","volume":"17","author":"M.M. Syslo","year":"1982","unstructured":"Syslo, M.M.: The subgraph isomorphism problem for outerplanar graphs. Theoret. Comput. Sci.\u00a017, 91\u201397 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR16","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. Proc. Lett.\u00a092, 57\u201363 (2004)","journal-title":"Inf. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:07:57Z","timestamp":1620130077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}