{"id":"https://openalex.org/W1881219236","doi":"https://doi.org/10.1007/978-3-642-40988-2_40","title":"Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width","display_name":"Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1881219236","doi":"https://doi.org/10.1007/978-3-642-40988-2_40","mag":"1881219236"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40988-2_40","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-40988-2_40","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-40988-2_40.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-40988-2_40.pdf","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"]},{"id":"https://openalex.org/I4210144576","display_name":"Fraunhofer Institute for Intelligent Analysis and Information Systems","ror":"https://ror.org/04nc32781","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210144576","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tam\u00e1s Horv\u00e1th","raw_affiliation_strings":["Dept. of Computer Science III, University of Bonn, Germany","Schloss Birlinghoven, Fraunhofer IAIS, Sankt Augustin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science III, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Schloss Birlinghoven, Fraunhofer IAIS, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I4210144576"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091332862","display_name":"Keisuke Otaki","orcid":"https://orcid.org/0000-0001-9431-0867"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Keisuke Otaki","raw_affiliation_strings":["Dept. of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","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":["Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2255,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79522117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"622","last_page":"637"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8459424376487732},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7994931936264038},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6309982538223267},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5123487710952759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.510333240032196},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46774131059646606},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4547500014305115},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4484807550907135},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4134170413017273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40825071930885315},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20961028337478638},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1276128888130188}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8459424376487732},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7994931936264038},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6309982538223267},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5123487710952759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.510333240032196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46774131059646606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4547500014305115},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4484807550907135},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4134170413017273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40825071930885315},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20961028337478638},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1276128888130188},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-40988-2_40","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-40988-2_40","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-40988-2_40.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/403393","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/403393","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD), Prague, Czech republic, 23-27 September 2013","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publica.fraunhofer.de:publica/383530","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/383530","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":"doi:10.1007/978-3-642-40988-2_40","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-40988-2_40","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-40988-2_40.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324900","display_name":"Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn","ror":"https://ror.org/041nas322"},{"id":"https://openalex.org/F4320327368","display_name":"KDDI Foundation","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1881219236.pdf","grobid_xml":"https://content.openalex.org/works/W1881219236.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W179577048","https://openalex.org/W1489563933","https://openalex.org/W1991755800","https://openalex.org/W2000945011","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2015110766","https://openalex.org/W2029448190","https://openalex.org/W2038674294","https://openalex.org/W2059372025","https://openalex.org/W2073919081","https://openalex.org/W2076043677","https://openalex.org/W2087083200","https://openalex.org/W2099962227","https://openalex.org/W2125227861","https://openalex.org/W2128994830","https://openalex.org/W2138745909","https://openalex.org/W2159366821","https://openalex.org/W2161723275","https://openalex.org/W2169042011","https://openalex.org/W2171271527","https://openalex.org/W2172037773","https://openalex.org/W2986773320","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W2361654510","https://openalex.org/W1482551403","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2152074130","https://openalex.org/W2962884946","https://openalex.org/W2172037773"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}