{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:17:03Z","timestamp":1725517023110},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874782"},{"type":"electronic","value":"9783540874799"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87479-9_52","type":"book-chapter","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T15:26:48Z","timestamp":1218641208000},"page":"520-535","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems on graphs embedded in k-trees. Discrete Applied Mathematics\u00a023, 11\u201324 (1989)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"52_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011(1-2), 1\u201322 (1993)","journal-title":"Acta Cybernetica"},{"issue":"6","key":"52_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"52_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209(1\u20132), 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"52_CR5","first-page":"161","volume":"66","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Nijssen, S., Muntz, R.R., Kok, J.N.: Frequent subtree mining \u2013 an overview. Fundamenta Informaticae\u00a066, 161\u2013198 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"8","key":"52_CR6","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M. Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering\u00a017(8), 1036\u20131050 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"52_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"issue":"1&2","key":"52_CR8","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":"52_CR9","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.jcss.2007.01.003","volume":"73","author":"M.T. Hajiaghayi","year":"2007","unstructured":"Hajiaghayi, M.T., Nishimura, N.: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. Journal of Computer and System Sciences\u00a073(5), 755\u2013768 (2007)","journal-title":"Journal of Computer and System Sciences"},{"key":"52_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-73847-3_26","volume-title":"Inductive Logic Programming","author":"T. Horv\u00e1th","year":"2007","unstructured":"Horv\u00e1th, T., Bringmann, B., De Raedt, L.: Frequent hypergraph mining. In: Muggleton, S., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol.\u00a04455, pp. 244\u2013259. Springer, Heidelberg (2007)"},{"key":"52_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/1150402.1150427","volume-title":"Proc. of the 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"T. Horv\u00e1th","year":"2006","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proc. of the 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 197\u2013206. ACP Press, New York (2006)"},{"issue":"3","key":"52_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"issue":"1-3","key":"52_CR13","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"},{"issue":"3","key":"52_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of treewidth. Journal of Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87479-9_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:59:24Z","timestamp":1619510364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87479-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874782","9783540874799"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87479-9_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}