{"id":"https://openalex.org/W3011668974","doi":"https://doi.org/10.1142/s0129054120500069","title":"Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree","display_name":"Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree","publication_year":2020,"publication_date":"2020-02-01","ids":{"openalex":"https://openalex.org/W3011668974","doi":"https://doi.org/10.1142/s0129054120500069","mag":"3011668974"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054120500069","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054120500069","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","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":null},"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"]},{"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"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tatsuya Akutsu","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan"],"raw_orcid":"https://orcid.org/0000-0001-9763-797X","affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039842680","display_name":"Avraham A. Melkman","orcid":"https://orcid.org/0000-0002-6832-0102"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Avraham A. Melkman","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel"],"raw_orcid":"https://orcid.org/0000-0002-6832-0102","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"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/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]},{"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"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takeyuki Tamura","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1596-901X","affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016330265"],"corresponding_institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.05554632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"31","issue":"02","first_page":"253","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/treewidth","display_name":"Treewidth","score":0.8714263439178467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.840021014213562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.746752142906189},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.618571400642395},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6032591462135315},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5884182453155518},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.579765260219574},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.555061936378479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5525988936424255},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.49136272072792053},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4822595715522766},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4657021164894104},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.44069960713386536},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4402123987674713},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41496020555496216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3116019368171692},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1496286690235138}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8714263439178467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.840021014213562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.746752142906189},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.618571400642395},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6032591462135315},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5884182453155518},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.579765260219574},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.555061936378479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5525988936424255},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.49136272072792053},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4822595715522766},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4657021164894104},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.44069960713386536},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4402123987674713},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41496020555496216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3116019368171692},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1496286690235138},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054120500069","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054120500069","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3387275647","display_name":null,"funder_award_id":"25730005","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7054244577","display_name":null,"funder_award_id":"26540125","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7341139379","display_name":null,"funder_award_id":"26240034","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8863921658","display_name":null,"funder_award_id":"25250028","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W202023760","https://openalex.org/W1514401476","https://openalex.org/W1579643516","https://openalex.org/W1861597632","https://openalex.org/W1963920197","https://openalex.org/W1973322735","https://openalex.org/W1974672137","https://openalex.org/W1999414674","https://openalex.org/W2000945011","https://openalex.org/W2011162901","https://openalex.org/W2011911122","https://openalex.org/W2012438638","https://openalex.org/W2030996579","https://openalex.org/W2046820662","https://openalex.org/W2047667460","https://openalex.org/W2051658231","https://openalex.org/W2076043677","https://openalex.org/W2078814601","https://openalex.org/W2079856162","https://openalex.org/W2087083200","https://openalex.org/W2103626206","https://openalex.org/W2106441870","https://openalex.org/W2109294083","https://openalex.org/W2128203754","https://openalex.org/W2172037773","https://openalex.org/W2279593527","https://openalex.org/W2625266575","https://openalex.org/W2962819865","https://openalex.org/W2963589575","https://openalex.org/W2971952735","https://openalex.org/W4231597948"],"related_works":["https://openalex.org/W2032950096","https://openalex.org/W4287179103","https://openalex.org/W1578113210","https://openalex.org/W1526050170","https://openalex.org/W3126911753","https://openalex.org/W2033003769","https://openalex.org/W4297791186","https://openalex.org/W2809882961","https://openalex.org/W2113292309","https://openalex.org/W2766767719"],"abstract_inverted_index":{"We":[0,69,124],"consider":[1],"the":[2,10,35,49,64,82,91,95,115],"maximum":[3,11,36,65,83],"common":[4,12,59],"connected":[5,13,32,60],"edge":[6],"subgraph":[7,15,45,62],"problem":[8,16],"and":[9,139],"induced":[14,61],"for":[17,76,109,119,130],"simple":[18],"graphs":[19,79,98,120,135],"with":[20,34,63,99,121],"labeled":[21,24,78,134],"vertices":[22],"(or":[23],"edges).":[25],"The":[26,53],"former":[27],"is":[28,41,55,86],"to":[29,43,56],"find":[30,57],"a":[31,44,58],"graph":[33],"number":[37,66],"of":[38,46,48,67,136],"edges":[39],"that":[40,71],"isomorphic":[42],"each":[47],"two":[50],"input":[51],"graphs.":[52],"latter":[54],"vertices.":[68],"prove":[70],"both":[72,104,131],"problems":[73,105,132],"are":[74,106],"NP-hard":[75,107],"3-outerplanar":[77],"even":[80],"if":[81],"vertex":[84,141],"degree":[85],"bounded":[87,137,140],"by":[88],"4.":[89],"Since":[90],"reductions":[92],"used":[93],"in":[94],"proofs":[96],"construct":[97],"treewidth":[100,122,138],"at":[101],"most":[102],"4,":[103],"also":[108,125],"such":[110],"graphs,":[111],"which":[112],"significantly":[113],"improves":[114],"previous":[116],"hardness":[117],"results":[118],"11.":[123],"present":[126],"improved":[127],"exponential-time":[128],"algorithms":[129],"on":[133],"degree.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}