{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:19:27Z","timestamp":1764688767430},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T00:00:00Z","timestamp":1264464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10618-009-0162-1","type":"journal-article","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T11:10:24Z","timestamp":1264417824000},"page":"472-508","source":"Crossref","is-referenced-by-count":34,"title":["Frequent subgraph mining in outerplanar graphs"],"prefix":"10.1007","volume":"21","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"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,26]]},"reference":[{"key":"162_CR1","first-page":"307","volume-title":"Advances in knowledge discovery and data mining","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo AI (1996) Fast discovery of association rules. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. AAAI Press\/The MIT Press, Menlo Park, CA, pp 307\u2013328"},{"issue":"1\u20132","key":"162_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender HL (1998) A partial k-arboretum of graphs with bounded treewidth. Theor Comput Sci 209(1\u20132): 1\u201345","journal-title":"Theor Comput Sci"},{"key":"162_CR3","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold M (2002) Mining molecular fragments: finding relevant substructures of molecules. In: Proceedings of the 2002 IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 51\u201358","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"162_CR4","doi-asserted-by":"crossref","unstructured":"Calders T, Ramon J, Van Dyck D (2008) Anti-monotonic overlap-graph support measures. In: Proceedings of the 2008 IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 73\u201382","DOI":"10.1109\/ICDM.2008.114"},{"issue":"4","key":"162_CR5","first-page":"433","volume":"3","author":"G Chartrand","year":"1967","unstructured":"Chartrand G, Harary F (1967) Planar permutation graphs. Annales de l\u2019institut Henri Poincar\u00e9, (Sec. B) Probabilit\u00e9s et Statistiques 3(4): 433\u2013438","journal-title":"Annales de l\u2019institut Henri Poincar\u00e9, (Sec. B) Probabilit\u00e9s et Statistiques"},{"key":"162_CR6","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi Y, Nijssen S, Muntz RR, Kok JN (2005) Frequent subtree mining\u2013an overview. Fundam Inform 66: 161\u2013198","journal-title":"Fundam Inform"},{"issue":"2","key":"162_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10115-004-0180-7","volume":"8","author":"Y Chi","year":"2005","unstructured":"Chi Y, Yang Y, Muntz RR (2005) Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl Inf Syst 8(2): 203\u2013234","journal-title":"Knowl Inf Syst"},{"key":"162_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D Cook","year":"1994","unstructured":"Cook D, Holder L (1994) Substructure discovery using minimum description length and background knowledge. J Artif Intell Res 1: 231\u2013255","journal-title":"J Artif Intell Res"},{"issue":"8","key":"162_CR9","doi-asserted-by":"crossref","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 (2005) Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans Knowl Data Eng 17(8): 1036\u20131050","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"162_CR10","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory. 3. Springer, Heidelberg","edition":"3"},{"issue":"2","key":"162_CR11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/jctb.1997.1812","volume":"72","author":"T Feder","year":"1998","unstructured":"Feder T, Hell P (1998) List homomorphisms to reflexive graphs. J Comb Theory B 72(2): 236\u2013250","journal-title":"J Comb Theory B"},{"key":"162_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"162_CR13","volume-title":"Graph theory","author":"F Harary","year":"1971","unstructured":"Harary F (1971) Graph theory. Addison-Wesley, Reading"},{"key":"162_CR14","doi-asserted-by":"crossref","unstructured":"He H, Singh AK (2007) Efficient algorithms for mining significant substructures in graphs with quality guarantees. In: Proceedings of the 2007 IEEE international conference on data mining (ICDM). IEEE Computer Society, pp 163\u2013172","DOI":"10.1109\/ICDM.2007.11"},{"key":"162_CR15","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(71)90065-7","volume":"10","author":"S Hedetniemi","year":"1971","unstructured":"Hedetniemi S, Chartrand G, Geller D (1971) Graphs with forbidden suhgraphs. J Comb Theory 10: 12\u201341","journal-title":"J Comb Theory"},{"key":"162_CR16","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Wong JK (1974) Linear time algorithm for isomorphism of planar graphs. In: Proceedings of the sixth annual ACM symposium on theory of Computing (STOC). ACM Press, New York, pp 172\u2013184","DOI":"10.1145\/800119.803896"},{"key":"162_CR17","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th T (2005) Cyclic pattern kernels revisited. In: Proceedings of the 9th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD), vol 3518 of LNAI. Springer, Heidelberg, pp 791\u2013801","DOI":"10.1007\/11430919_93"},{"key":"162_CR18","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th T, Bringmann B, Raedt LD (2007) Frequent hypergraph mining. In: Proceedings of the 16th international conference on inductive logic programming (ILP), vol 4455 of LNAI. Springer, Heidelberg, pp 244\u2013259","DOI":"10.1007\/978-3-540-73847-3_26"},{"issue":"1\/2","key":"162_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/A:1007668716498","volume":"43","author":"T Horv\u00e1th","year":"2001","unstructured":"Horv\u00e1th T, Wrobel S, Bohnebeck U (2001) Relational instance-based learning with lists and terms. Mach Learn 43(1\/2): 53\u201380","journal-title":"Mach Learn"},{"issue":"3","key":"162_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from graphs: mining graph data. Mach Learn 50(3): 321\u2013354","journal-title":"Mach Learn"},{"issue":"3","key":"162_CR21","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson DS, Papadimitriou CH, Yannakakis M (1988) On generating all maximal independent sets. Inform Process Lett 27(3): 119\u2013123","journal-title":"Inform Process Lett"},{"key":"162_CR22","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/j.1538-7305.1980.tb03008.x","volume":"59","author":"W Koontz","year":"1980","unstructured":"Koontz W (1980) Economic evaluation of loop feeder relief alternatives. Bell Syst Tech J 59: 277\u2013281","journal-title":"Bell Syst Tech J"},{"key":"162_CR23","doi-asserted-by":"crossref","unstructured":"Kramer S, De Raedt L, Helma C (2001) Molecular feature mining in HIV data. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, New York, pp 136\u2013143","DOI":"10.1145\/502512.502533"},{"key":"162_CR24","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the 2001 international conference on data mining (ICDM). IEEE Computer Society, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"162_CR25","doi-asserted-by":"crossref","unstructured":"Leydold J, Stadler PF (1998) Minimal cycle bases of outerplanar graphs. Electron J Comb 5","DOI":"10.37236\/1354"},{"issue":"3","key":"162_CR26","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(89)90011-X","volume":"63","author":"A Lingas","year":"1989","unstructured":"Lingas A (1989) Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theor Comput Sci 63(3): 295\u2013302","journal-title":"Theor Comput Sci"},{"issue":"3","key":"162_CR27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Mining Knowl Discover 1(3): 241\u2013258","journal-title":"Data Mining Knowl Discover"},{"key":"162_CR28","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70324-8","volume":"2","author":"DW Matula","year":"1978","unstructured":"Matula DW (1978) Subtree isomorphism in O(n 5\/2). Ann Discrete Math 2: 91\u2013106","journal-title":"Ann Discrete Math"},{"key":"162_CR29","doi-asserted-by":"crossref","unstructured":"Maunz A, Helma C, Kramer S (2009) Large-scale graph mining using backbone refinement classes. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, New York, pp 617\u2013626","DOI":"10.1145\/1557019.1557089"},{"issue":"5","key":"162_CR30","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"SL Mitchell","year":"1979","unstructured":"Mitchell SL (1979) Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform Process Lett 9(5): 229\u2013232","journal-title":"Inform Process Lett"},{"key":"162_CR31","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, New York, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"issue":"4","key":"162_CR32","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/TCS.1986.1085934","volume":"33","author":"T Nishi","year":"1986","unstructured":"Nishi T, Chua LO (1986) Uniqueness of solution for nonlinear resistive circuits containing CCCS\u2019s or VCVS\u2019s whose controlling coefficients are finite. IEEE Trans Circuits Syst 33(4): 381\u2013397","journal-title":"IEEE Trans Circuits Syst"},{"key":"162_CR33","first-page":"907","volume":"10","author":"J Ramon","year":"2009","unstructured":"Ramon J, Nijssen S (2009) Polynomial-delay enumeration of monotonic graph classes. J Mach Learn Res 10: 907\u2013929","journal-title":"J Mach Learn Res"},{"issue":"3","key":"162_CR34","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"RC Read","year":"1975","unstructured":"Read RC, Tarjan RE (1975) Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3): 237\u2013252","journal-title":"Networks"},{"key":"162_CR35","unstructured":"Schietgat L, Costa F, Ramon J, De Raedt L (2009) Maximum common subgraph mining: a fast and effective approach towards feature generation. In: Proceedings of the 7th international workshop on mining and learning with graphs (MLG). Leuven, Belgium, pp 1\u20133"},{"key":"162_CR36","doi-asserted-by":"crossref","unstructured":"Schietgat L, Ramon J, Bruynooghe M, Blockeel H (2008) An efficiently computable graph-based metric for the classification of small molecules. In: Proceedings of the 11th international conference on discovery science (DS), vol 5255 of LNAI. Springer, Heidelberg, pp 197\u2013209","DOI":"10.1007\/978-3-540-88411-8_20"},{"issue":"2","key":"162_CR37","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R Shamir","year":"1999","unstructured":"Shamir R, Tsur D (1999) Faster subtree isomorphism. J Algorithms 33(2): 267\u2013280","journal-title":"J Algorithms"},{"key":"162_CR38","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","volume":"17","author":"MM Syslo","year":"1982","unstructured":"Syslo MM (1982) The subgraph isomorphism problem for outerplanar graphs. Theor Comput Sci 17: 91\u201397","journal-title":"Theor Comput Sci"},{"issue":"2","key":"162_CR39","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2): 146\u2013160","journal-title":"SIAM J Comput"},{"key":"162_CR40","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T (2007) Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, New York, pp 737\u2013746","DOI":"10.1145\/1281192.1281271"},{"key":"162_CR41","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining. IEEE Computer Society, pp 721\u2013724"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0162-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-009-0162-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0162-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T00:55:08Z","timestamp":1590540908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-009-0162-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,26]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s10618-009-0162-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,26]]}}}