{"id":"https://openalex.org/W3002269711","doi":"https://doi.org/10.1137/20m1320146","title":"Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs","display_name":"Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3002269711","doi":"https://doi.org/10.1137/20m1320146","mag":"3002269711"},"language":"en","primary_location":{"id":"doi:10.1137/20m1320146","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1320146","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1906.08371","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076603106","display_name":"Karolina Okrasa","orcid":"https://orcid.org/0000-0003-1414-3507"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Karolina Okrasa","raw_affiliation_strings":["Warsaw University of Technology, Poland and University of Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, Poland and University of Warsaw, Poland","institution_ids":["https://openalex.org/I108403487","https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047941027","display_name":"Pawe\u0142 Rz\u0105\u017cewski","orcid":"https://orcid.org/0000-0001-7696-3848"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Rza\u0345\u017cewski","raw_affiliation_strings":["Warsaw University of Technology, POLAND"],"raw_orcid":"https://orcid.org/0000-0001-7696-3848","affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, POLAND","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01457067,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":"2","first_page":"487","last_page":"508"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"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.9962000250816345,"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.9110999703407288,"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/combinatorics","display_name":"Combinatorics","score":0.7766664624214172},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7624657154083252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6216079592704773},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.5806506872177124},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5618206262588501},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5597373247146606},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.49054187536239624},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.48243436217308044},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.43308117985725403},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.42709892988204956},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4197857081890106},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4128509759902954},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3344472050666809},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.32292330265045166},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31952518224716187},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2797166705131531}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7766664624214172},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7624657154083252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6216079592704773},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.5806506872177124},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5618206262588501},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5597373247146606},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49054187536239624},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.48243436217308044},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.43308117985725403},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.42709892988204956},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4197857081890106},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4128509759902954},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3344472050666809},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32292330265045166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31952518224716187},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2797166705131531}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/20m1320146","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1320146","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1906.08371","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.08371","pdf_url":"https://arxiv.org/pdf/1906.08371","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.1906.08371","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1906.08371","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1906.08371","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.08371","pdf_url":"https://arxiv.org/pdf/1906.08371","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2710479047","display_name":"Cuts and decompositions: algorithms and combinatorial properties","funder_award_id":"714704","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G7561358084","display_name":null,"funder_award_id":"2018/31/D/ST6/00062","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3002269711.pdf"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1429713103","https://openalex.org/W1494193561","https://openalex.org/W1977197609","https://openalex.org/W1979147290","https://openalex.org/W1984264511","https://openalex.org/W1985572324","https://openalex.org/W1991755800","https://openalex.org/W1995725694","https://openalex.org/W2002722727","https://openalex.org/W2008440715","https://openalex.org/W2021180976","https://openalex.org/W2022623224","https://openalex.org/W2028357390","https://openalex.org/W2033470072","https://openalex.org/W2043220195","https://openalex.org/W2047039514","https://openalex.org/W2050939144","https://openalex.org/W2070374625","https://openalex.org/W2073279331","https://openalex.org/W2074359677","https://openalex.org/W2075646995","https://openalex.org/W2077575555","https://openalex.org/W2085550081","https://openalex.org/W2090463147","https://openalex.org/W2132911512","https://openalex.org/W2144067625","https://openalex.org/W2286480406","https://openalex.org/W2324654759","https://openalex.org/W2326118140","https://openalex.org/W2964099322","https://openalex.org/W2969838569","https://openalex.org/W4229970255","https://openalex.org/W4235585751","https://openalex.org/W4238913085","https://openalex.org/W4247305611"],"related_works":["https://openalex.org/W2056827961","https://openalex.org/W1910126432","https://openalex.org/W1550179875","https://openalex.org/W2893490363","https://openalex.org/W399388665","https://openalex.org/W2568038260","https://openalex.org/W3159532254","https://openalex.org/W2017876021","https://openalex.org/W2951939916","https://openalex.org/W2963353391","https://openalex.org/W3022807994","https://openalex.org/W2963672880","https://openalex.org/W2963063614","https://openalex.org/W2963603765","https://openalex.org/W3178745238","https://openalex.org/W1970496268","https://openalex.org/W2958946272","https://openalex.org/W3173410328","https://openalex.org/W2128909567","https://openalex.org/W205622278"],"abstract_inverted_index":{"For":[0],"a":[1,15,20,61,64,130,148,156,186,191,220],"fixed":[2],"graph":[3,17,38,100,232],"$H$,":[4,23,196,226],"by":[5,94,246],"Hom($H$)":[6,51,168],"we":[7,84],"denote":[8],"the":[9,88,91,95,98,119,152,162,167,208],"computational":[10],"problem":[11,120,169],"which":[12,242],"asks":[13],"whether":[14,136],"given":[16,109],"$G$":[18,103],"admits":[19],"homomorphism":[21],"to":[22,30,36],"i.e.,":[24],"an":[25],"edge-preserving":[26],"mapping":[27],"from":[28,230],"$V(G)$":[29],"$V(H)$.":[31],"As":[32],"Hom($K_k$)":[33],"is":[34,48,52,57,108,147,159],"equivalent":[35],"$k$-Coloring,":[37],"homomorphisms":[39],"can":[40,121,139,211],"be":[41,122,140,171,212],"seen":[42],"as":[43,197],"generalizations":[44],"of":[45,90,97,115,154,194],"colorings.":[46],"It":[47],"known":[49,239],"that":[50,144,207],"polynomial-time":[53],"solvable":[54],"if":[55,145],"$H$":[56,146,217,241],"bipartite":[58],"or":[59],"has":[60,104],"vertex":[62],"with":[63,111],"loop,":[65],"and":[66,70,107,218],"NP-complete":[67],"otherwise":[68],"[Hell":[69],"Ne\u0161et\u0159il,":[71],"J.":[72],"Comb.":[73],"Theory":[74],"Ser.":[75],"B,":[76],"48":[77],"(1990),":[78],"pp.":[79],"92--110].":[80],"In":[81,234],"this":[82,137],"paper":[83],"are":[85,201,237,243],"interested":[86],"in":[87,124,173],"complexity":[89,188,221],"problem,":[92],"parameterized":[93],"treewidth":[96],"input":[99],"$G$.":[101],"If":[102],"$n$":[105],"vertices":[106],"along":[110],"its":[112],"tree":[113],"decomposition":[114],"width":[116],"${tw}(G)$,":[117],"then":[118,151],"solved":[123,172],"time":[125,174],"$|V(H)|^{{tw}(G)}":[126],"\\cdot":[127,176],"n^{\\mathcal{O}(1)}$,":[128,177],"using":[129],"straightforward":[131],"dynamic":[132],"programming.":[133],"We":[134,142,204],"explore":[135],"bound":[138],"improved.":[141],"show":[143,219],"projective":[149,202],"core,":[150],"existence":[153],"such":[155],"faster":[157],"algorithm":[158,210],"unlikely:":[160],"assuming":[161,227],"Strong":[163],"Exponential":[164],"Time":[165],"Hypothesis,":[166],"cannot":[170],"$(|V(H)|-\\epsilon)^{{tw}(G)}":[175],"for":[178,190,214,223],"any":[179],"$\\epsilon":[180],">":[181],"0$.":[182],"This":[183],"result":[184],"provides":[185],"full":[187],"characterization":[189],"large":[192],"class":[193],"graphs":[195,200,216,225,240],"almost":[198],"all":[199,224],"cores.":[203],"also":[205],"notice":[206],"naive":[209],"improved":[213],"some":[215],"classification":[222],"two":[228],"conjectures":[229],"algebraic":[231],"theory.":[233],"particular,":[235],"there":[236],"no":[238],"not":[244],"covered":[245],"our":[247],"result.":[248]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2020-01-30T00:00:00"}