{"id":"https://openalex.org/W192266888","doi":"https://doi.org/10.1007/978-3-642-32589-2_10","title":"A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree","display_name":"A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W192266888","doi":"https://doi.org/10.1007/978-3-642-32589-2_10","mag":"192266888"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-32589-2_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32589-2_10","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016330265","display_name":"Tatsuya Akutsu","orcid":"https://orcid.org/0000-0001-9763-797X"},"institutions":[{"id":"https://openalex.org/I4399598384","display_name":"Kyoto University Institute for Chemical Research","ror":"https://ror.org/0349bbg69","country_code":null,"type":"facility","lineage":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]},{"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":true,"raw_author_name":"Tatsuya Akutsu","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041203895","display_name":"Takeyuki Tamura","orcid":"https://orcid.org/0000-0003-1596-901X"},"institutions":[{"id":"https://openalex.org/I4399598384","display_name":"Kyoto University Institute for Chemical Research","ror":"https://ror.org/0349bbg69","country_code":null,"type":"facility","lineage":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]},{"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":"Takeyuki Tamura","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016330265"],"corresponding_institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1921,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85622347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"76","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6207563281059265},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6022971272468567},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5980937480926514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5547760128974915},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5459976196289062},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.527214765548706},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5070343017578125},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4831692576408386},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.48153573274612427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4743056297302246},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44340670108795166},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43155890703201294},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4192923903465271},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.38917696475982666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38261914253234863},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34430134296417236},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17086318135261536}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6207563281059265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6022971272468567},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5980937480926514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5547760128974915},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5459976196289062},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.527214765548706},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5070343017578125},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4831692576408386},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.48153573274612427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4743056297302246},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44340670108795166},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43155890703201294},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4192923903465271},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.38917696475982666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38261914253234863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34430134296417236},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17086318135261536},{"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/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-32589-2_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32589-2_10","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W96186885","https://openalex.org/W1514401476","https://openalex.org/W1605991832","https://openalex.org/W1999414674","https://openalex.org/W2000945011","https://openalex.org/W2011039300","https://openalex.org/W2047667460","https://openalex.org/W2071484148","https://openalex.org/W2078814601","https://openalex.org/W2103626206","https://openalex.org/W2106441870","https://openalex.org/W2109294083","https://openalex.org/W2128994830","https://openalex.org/W2164155173","https://openalex.org/W2172037773","https://openalex.org/W2172501726","https://openalex.org/W2971253248"],"related_works":["https://openalex.org/W3008959778","https://openalex.org/W2789636091","https://openalex.org/W176100319","https://openalex.org/W2288163449","https://openalex.org/W2032950096","https://openalex.org/W1533352539","https://openalex.org/W2076040942","https://openalex.org/W4381707488","https://openalex.org/W2031967239","https://openalex.org/W2307034528"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}