{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:14:05Z","timestamp":1748751245152,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319237077"},{"type":"electronic","value":"9783319237084"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23708-4_14","type":"book-chapter","created":{"date-parts":[[2015,12,26]],"date-time":"2015-12-26T08:08:52Z","timestamp":1451117332000},"page":"194-209","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Frequent Subtree Mining in Very Simple Structures"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Welke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,27]]},"reference":[{"key":"14_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"issue":"9","key":"14_CR2","first-page":"1488","volume":"76","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. Fundam. Electron. Commun. Comput. Sci. 76(9), 1488\u20131493 (1993)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: ICDM, pp. 509\u2013512. IEEE Computer Society (2003)","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"14_CR4","series-title":"Cognitive Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and Relational Learning","author":"L Raedt De","year":"2008","unstructured":"De Raedt, L.: Logical and Relational Learning. Cognitive Technologies. Springer, Heidelberg (2008)"},{"key":"14_CR5","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2012)"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10472-012-9324-8","volume":"69","author":"GC Garriga","year":"2013","unstructured":"Garriga, G.C., Khardon, R., De Raedt, L.: Mining closed patterns in relational, graph and network data. Ann. Math. Artif. Intell. 69(4), 315\u2013342 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G Gottlob","year":"1987","unstructured":"Gottlob, G.: Subsumption and implication. Inf. Process. Lett. 24(2), 109\u2013111 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"14_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. Syst. Sci. 73(5), 755\u2013768 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"14_CR10","series-title":"Addison-Wesley Series in Mathematics","volume-title":"Graph Theory","author":"F Harary","year":"1994","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Series in Mathematics. Perseus Books, Boulder (1994)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $${\\rm n}^{\\wedge }5\/2$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"31\u201333","key":"14_CR12","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.1016\/j.tcs.2010.03.030","volume":"411","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J.: Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci. 411(31\u201333), 2784\u20132797 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s10618-009-0162-1","volume":"21","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21(3), 472\u2013508 (2010)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1\u20132","key":"14_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(01)00062-5","volume":"128","author":"T Horv\u00e1th","year":"2001","unstructured":"Horv\u00e1th, T., Tur\u00e1n, G.: Learning logic programs with structured background knowledge. Artif. Intell. 128(1\u20132), 31\u201397 (2001)","journal-title":"Artif. Intell."},{"issue":"3","key":"14_CR15","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. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"14_CR16","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 Math. 108(1), 343\u2013364 (1992)","journal-title":"Discrete Math."},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"RC Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.: Bound on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. In: Proceedings of the Fifth Israeli Symposium on the Theory of Computing and Systems, pp. 126\u2013131. IEEE (1997)","DOI":"10.1109\/ISTCS.1997.595164"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23708-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:02:47Z","timestamp":1748732567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23708-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319237077","9783319237084"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23708-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}