{"id":"https://openalex.org/W2128994830","doi":"https://doi.org/10.1145/1150402.1150427","title":"Frequent subgraph mining in outerplanar graphs","display_name":"Frequent subgraph mining in outerplanar graphs","publication_year":2006,"publication_date":"2006-08-20","ids":{"openalex":"https://openalex.org/W2128994830","doi":"https://doi.org/10.1145/1150402.1150427","mag":"2128994830"},"language":"en","primary_location":{"id":"doi:10.1145/1150402.1150427","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1150402.1150427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/132020","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101911318","display_name":"Tam\u00e1s Horv\u00e1th","orcid":"https://orcid.org/0000-0001-6852-6939"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tam\u00e1s Horv\u00e1th","raw_affiliation_strings":["University of Bonn & Fraunhofer Institute IAIS, Sankt Augustin, Germany","University of Bonn & Fraunhofer Institute IAIS, Sankt Augustin, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn & Fraunhofer Institute IAIS, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn & Fraunhofer Institute IAIS, Sankt Augustin, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077665746","display_name":"Jan Ramon","orcid":"https://orcid.org/0000-0002-0558-7176"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Jan Ramon","raw_affiliation_strings":["Katholieke Universiteit, Leuven, Belgium","Katholieke Universiteit , Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Katholieke Universiteit, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Katholieke Universiteit , Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108279292","display_name":"Stefan Wrobel","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Wrobel","raw_affiliation_strings":["Fraunhofer Institute IAIS & University of Bonn, Sankt Augustin, Germany","Fraunhofer Institute IAIS & University of Bonn, Sankt Augustin, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fraunhofer Institute IAIS & University of Bonn, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Fraunhofer Institute IAIS & University of Bonn, Sankt Augustin, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.2576,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.97593311,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"197","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5680304765701294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5373131036758423},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4923638105392456},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4920036494731903},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.48849761486053467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47345253825187683},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.47017115354537964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46866095066070557},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.45252010226249695},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4309549629688263},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4278453588485718},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4268406629562378},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39921361207962036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3905496299266815},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36843788623809814},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1984466016292572},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08377522230148315}],"concepts":[{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5680304765701294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5373131036758423},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4923638105392456},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4920036494731903},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.48849761486053467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47345253825187683},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.47017115354537964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46866095066070557},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.45252010226249695},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4309549629688263},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4278453588485718},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4268406629562378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39921361207962036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3905496299266815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36843788623809814},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1984466016292572},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08377522230148315},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1150402.1150427","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1150402.1150427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},{"id":"pmh:oai:fraunhofer.de:N-46125","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-46125.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer IAIS","raw_type":"Conference Paper"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/132020","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/132020","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, 20-23 August 2006","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publica.fraunhofer.de:publica/351388","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/351388","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/132020","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/132020","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, 20-23 August 2006","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W108777047","https://openalex.org/W855674090","https://openalex.org/W1489563933","https://openalex.org/W1549085911","https://openalex.org/W1553696291","https://openalex.org/W1570200918","https://openalex.org/W1592376869","https://openalex.org/W1965380924","https://openalex.org/W1970259423","https://openalex.org/W1985104873","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2041140023","https://openalex.org/W2046021036","https://openalex.org/W2048653843","https://openalex.org/W2071484148","https://openalex.org/W2087083200","https://openalex.org/W2093092867","https://openalex.org/W2099962227","https://openalex.org/W2114654749","https://openalex.org/W2118382442","https://openalex.org/W2119148238","https://openalex.org/W2124996875","https://openalex.org/W2125227861","https://openalex.org/W2128695242","https://openalex.org/W2131364423","https://openalex.org/W2132911512","https://openalex.org/W2134351561","https://openalex.org/W2136593687","https://openalex.org/W2161723275","https://openalex.org/W2168678327","https://openalex.org/W2170726034","https://openalex.org/W2172037773","https://openalex.org/W2476096155","https://openalex.org/W2767970464","https://openalex.org/W2798588639","https://openalex.org/W2799004609","https://openalex.org/W3202159599","https://openalex.org/W4285719527","https://openalex.org/W4300159468","https://openalex.org/W6629172744","https://openalex.org/W6633402183"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W2953496651","https://openalex.org/W2886672068","https://openalex.org/W2604114816","https://openalex.org/W231720905","https://openalex.org/W2811238889","https://openalex.org/W2397707437","https://openalex.org/W1992416685","https://openalex.org/W3151217588"],"abstract_inverted_index":{"In":[0,75],"recent":[1],"years":[2],"there":[3],"has":[4],"been":[5],"an":[6],"increased":[7],"interest":[8],"in":[9,17,37,105],"algorithms":[10],"that":[11,103],"can":[12,34],"perform":[13],"frequent":[14,26,95],"pattern":[15],"discovery":[16],"large":[18],"databases":[19],"of":[20,59,82,91],"graph":[21,46,71,118],"structured":[22],"objects.":[23],"While":[24],"the":[25,60,80,111,115],"connected":[27],"subgraph":[28,96],"mining":[29,97],"problem":[30],"for":[31,44,99],"tree":[32],"datasets":[33],"be":[35],"solved":[36],"incremental":[38,106],"polynomial":[39,107],"time,":[40,108],"it":[41],"becomes":[42],"intractable":[43],"arbitrary":[45],"databases.":[47],"Existing":[48],"approaches":[49],"have":[50,64],"therefore":[51],"resorted":[52],"to":[53],"various":[54],"heuristic":[55],"strategies":[56],"and":[57,109],"restrictions":[58],"search":[61],"space,":[62],"but":[63],"not":[65],"identified":[66],"a":[67,88,94],"practically":[68],"relevant":[69],"tractable":[70],"class":[72,81],"beyond":[73],"trees.":[74],"this":[76],"paper,":[77],"we":[78],"define":[79],"so":[83],"called":[84],"tenuous":[85,100],"outerplanar":[86,101],"graphs,":[87],"strict":[89],"generalization":[90],"trees,":[92],"develop":[93],"algorithm":[98,112],"graphs":[102],"works":[104],"evaluate":[110],"empirically":[113],"on":[114],"NCI":[116],"molecular":[117],"dataset.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}