{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:06Z","timestamp":1763468226658,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_7","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"81-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay"],"prefix":"10.1007","author":[{"given":"Andre","family":"Droschinsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Heinemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils","family":"Kriege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"1","key":"7_CR1","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 6(1), 119\u2013135 (2013)","journal-title":"Algorithms"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.tcs.2005.09.038","volume":"349","author":"F Cazals","year":"2005","unstructured":"Cazals, F., Karande, C.: An algorithm for reporting maximal $$c$$-cliques. Theoretical Computer Science 349(3), 484\u2013490 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_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. Recognit. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern. Recognit. Artif. Intell."},{"key":"7_CR5","volume-title":"Combinatorial Optimization","author":"WJ Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley & Sons Inc., New York (1998)"},{"key":"7_CR6","unstructured":"Droschinsky, A.: Effiziente Enumerationsalgorithmen f\u00fcr Common Subtree Probleme. Master\u2019s thesis, Technische Universit\u00e4t Dortmund (2014)"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/net.3230220504","volume":"22","author":"K Fukuda","year":"1992","unstructured":"Fukuda, K., Matsui, T.: Finding all minimum-cost perfect matchings in bipartite graphs. Networks 22(5), 461\u2013468 (1992)","journal-title":"Networks"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/jagm.2001.1163","volume":"40","author":"MY Kao","year":"2001","unstructured":"Kao, M.Y., Lam, T.W., Sung, W.K., Ting, H.F.: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. J. Algorithms 40(2), 212\u2013233 (2001)","journal-title":"J. Algorithms"},{"issue":"12","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science 250(12), 1\u201330 (2001)","journal-title":"Theoretical Computer Science"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-662-44465-8_43","volume-title":"Mathematical Foundations of Computer Science 2014","author":"N Kriege","year":"2014","unstructured":"Kriege, N., Mutzel, P.: Finding maximum common biconnected subgraphs in series-parallel graphs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 505\u2013516. Springer, Heidelberg (2014)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1973","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9(4), 341\u2013352 (1973)","journal-title":"Calcolo"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Matula, D.W.: Subtree isomorphism in $$O(n^{5\/2})$$. In: Algorithmic Aspects of Combinatorics, Ann. Discrete Math., vol. 2, pp. 91\u2013106. Elsevier (1978)","DOI":"10.1016\/S0167-5060(08)70324-8"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1023\/A:1008068904628","volume":"12","author":"M Rarey","year":"1998","unstructured":"Rarey, M., Dixon, J.: Feature trees: A new molecular similarity measure based on tree matching. Journal of Computer-Aided Molecular Design 12(5), 471\u2013490 (1998)","journal-title":"Journal of Computer-Aided Molecular Design"},{"issue":"7","key":"7_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"JW Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Comput. Aided Mol. Des. 16(7), 521\u2013533 (2002)","journal-title":"J. Comput. Aided Mol. Des."},{"key":"7_CR17","unstructured":"Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time metric for outerplanar graphs. In: Frasconi, P., Kersting, K., Tsuda, K. (eds.) Mining and Learning with Graphs (2007)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-63890-3_11","volume-title":"Algorithms and Computation","author":"T Uno","year":"1997","unstructured":"Uno, T.: Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 92\u2013101. Springer, Heidelberg (1997)"},{"issue":"2","key":"7_CR19","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. 92(2), 57\u201363 (2004)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:12:16Z","timestamp":1676419936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}