{"id":"https://openalex.org/W2143238590","doi":"https://doi.org/10.1145/2535926","title":"Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries","display_name":"Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2143238590","doi":"https://doi.org/10.1145/2535926","mag":"2143238590"},"language":"en","primary_location":{"id":"doi:10.1145/2535926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2535926","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"],"apc_list":null,"apc_paid":null,"fwci":14.5809,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.99278367,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"60","issue":"6","first_page":"1","last_page":"51"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/hypergraph","display_name":"Hypergraph","score":0.8337461948394775},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7695174217224121},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7575591802597046},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.724918007850647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6956294775009155},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6446177959442139},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6169673800468445},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.610794723033905},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5384381413459778},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5156346559524536},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49351346492767334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.470355749130249},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4313633441925049},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36954277753829956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20281252264976501},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15182223916053772},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1316658854484558},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.07979586720466614}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8337461948394775},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7695174217224121},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7575591802597046},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.724918007850647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6956294775009155},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6446177959442139},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6169673800468445},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.610794723033905},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5384381413459778},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5156346559524536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49351346492767334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.470355749130249},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4313633441925049},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36954277753829956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20281252264976501},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15182223916053772},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1316658854484558},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.07979586720466614},{"id":"https://openalex.org/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2535926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2535926","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5539758277","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7324173974","display_name":null,"funder_award_id":"NK105645","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W52840101","https://openalex.org/W99828349","https://openalex.org/W153181359","https://openalex.org/W1485335602","https://openalex.org/W1517036688","https://openalex.org/W1539745358","https://openalex.org/W1570425181","https://openalex.org/W1571197496","https://openalex.org/W1603707154","https://openalex.org/W1973819999","https://openalex.org/W1979514837","https://openalex.org/W1983022219","https://openalex.org/W1989801809","https://openalex.org/W1993704152","https://openalex.org/W1994520092","https://openalex.org/W1995725694","https://openalex.org/W1997649256","https://openalex.org/W2006772093","https://openalex.org/W2006830086","https://openalex.org/W2008362572","https://openalex.org/W2008536061","https://openalex.org/W2009924457","https://openalex.org/W2012948111","https://openalex.org/W2021183451","https://openalex.org/W2026745535","https://openalex.org/W2030827911","https://openalex.org/W2032487621","https://openalex.org/W2033325972","https://openalex.org/W2035575256","https://openalex.org/W2045675568","https://openalex.org/W2049197377","https://openalex.org/W2050280202","https://openalex.org/W2063951771","https://openalex.org/W2066776015","https://openalex.org/W2067443074","https://openalex.org/W2067706177","https://openalex.org/W2085367693","https://openalex.org/W2104498537","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2128059732","https://openalex.org/W2134483537","https://openalex.org/W2140285470","https://openalex.org/W2148417962","https://openalex.org/W2150004999","https://openalex.org/W2150339067","https://openalex.org/W2157827214","https://openalex.org/W2159738186","https://openalex.org/W2162561603","https://openalex.org/W2165880875","https://openalex.org/W2166566648","https://openalex.org/W2489198132","https://openalex.org/W2624220145","https://openalex.org/W2913688336","https://openalex.org/W3005023497","https://openalex.org/W4254380579","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2949978915","https://openalex.org/W2480025839","https://openalex.org/W2119213574","https://openalex.org/W1973538949","https://openalex.org/W2628596753","https://openalex.org/W2950294966","https://openalex.org/W1988026822","https://openalex.org/W2134402143","https://openalex.org/W4292713356","https://openalex.org/W3169968423"],"abstract_inverted_index":{"An":[0],"important":[1],"question":[2],"in":[3,86,96,120,151,285,349,439],"the":[4,14,19,23,26,29,44,49,52,57,60,63,73,145,152,163,171,174,179,273,297,299,310,316,321,344,354,362,370,383,440,443,450],"study":[5],"of":[6,22,28,51,59,62,81,105,130,147,165,173,181,192,223,290,306,313,334,365,372,391,431,452,460],"constraint":[7,39],"satisfaction":[8],"problems":[9,95],"(CSP)":[10],"is":[11,46,71,102,119,125,137,167,183,201,226,242,263,301,342,417,455],"understanding":[12],"how":[13],"graph":[15,61],"or":[16,140],"hypergraph":[17,118,211,397,416],"describing":[18],"incidence":[20],"structure":[21],"constraints":[24,64,77],"influences":[25],"complexity":[27,50],"problem.":[30],"For":[31,382],"binary":[32],"CSP":[33,89,113,413],"instances":[34,90,116,307,323,356],"(that":[35],"is,":[36],"where":[37],"each":[38,333],"involves":[40],"only":[41],"two":[42],"variables),":[43],"situation":[45],"well":[47],"understood:":[48],"problem":[53],"essentially":[54],"depends":[55],"on":[56,296,309,434],"treewidth":[58],"[Grohe":[65],"2007;":[66],"Marx":[67],"2010b].":[68],"However,":[69],"this":[70,339],"not":[72,264,269],"correct":[74],"answer":[75],"if":[76,100,253,395],"with":[78,359],"unbounded":[79,256],"number":[80,146,164,180,363,371],"variables":[82,166,182,314],"are":[83,324,357],"allowed,":[84],"and":[85,217,319,368,436],"particular,":[87],"for":[88,132,332],"arising":[91],"from":[92],"query":[93,157],"evaluation":[94],"database":[97,156],"theory.":[98],"Formally,":[99],"H":[101,110,121,135,193,197,224,240,254,261,398,418],"a":[103,184,209,227,246,286,292,304,328,351,379,389,396,404,412,429],"class":[104],"hypergraphs,":[106],"then":[107,259,320,403],"let":[108],"CSP(":[109,134,196,239,260],")":[111,136,198,241,262,448],"be":[112,347,376,408,459],"restricted":[114],"to":[115,126,155,361,427],"whose":[117,415],".":[122,419],"Our":[123],"goal":[124],"characterize":[127],"those":[128],"classes":[129],"hypergraphs":[131,435],"which":[133,457],"polynomial-time":[138,199,270],"solvable":[139,200],"fixed-parameter":[141,243,265],"tractable,":[142],"parameterized":[143],"by":[144,178,326,378,411],"variables.":[148],"Note":[149],"that":[150,162,194,219,238,252,343,353,394],"applications":[153],"related":[154],"evaluation,":[158],"we":[159,207,250,386,425],"usually":[160],"assume":[161],"much":[168],"smaller":[169],"than":[170,232],"size":[172],"instance,":[175],"thus":[176],"parameterization":[177],"meaningful":[185],"question.":[186],"The":[187,279,336],"most":[188],"general":[189,230],"known":[190],"property":[191,231],"makes":[195],"bounded":[202,220,233],"fractional":[203,234],"hypertree":[204,235],"width.":[205],"Here":[206],"introduce":[208],"new":[210,322,355],"measure":[212],"called":[213],"submodular":[214,221,257,380,401],"width":[215,222],",":[216],"show":[218,251],"(which":[225],"strictly":[228],"more":[229],"width)":[236],"implies":[237],"tractable.":[244],"In":[245],"matching":[247],"hardness":[248,384],"result,":[249,385],"has":[255,399],"width,":[258,402],"tractable":[266],"(and":[267],"hence":[268],"solvable),":[271],"unless":[272],"Exponential":[274],"Time":[275],"Hypothesis":[276],"(ETH)":[277],"fails.":[278],"algorithmic":[280],"result":[281],"uses":[282],"tree":[283,330],"decompositions":[284],"novel":[287],"way:":[288],"instead":[289],"using":[291],"single":[293],"decomposition":[294,331],"depending":[295],"hypergraph,":[298],"instance":[300,406,414],"split":[302],"into":[303],"set":[305,312],"(all":[308],"same":[311],"as":[315],"original":[317],"instance),":[318],"solved":[325],"choosing":[327],"different":[329],"them.":[335],"reason":[337],"why":[338],"strategy":[340],"works":[341],"splitting":[345],"can":[346,375,407,458],"done":[348],"such":[350],"way":[352],"\u201cuniform\u201d":[358],"respect":[360],"extensions":[364],"partial":[366,373],"solutions,":[367],"therefore":[369],"solutions":[374],"described":[377],"function.":[381],"prove":[387,421],"via":[388],"series":[390],"combinatorial":[392,423],"results":[393],"large":[400],"3SAT":[405],"efficiently":[409],"simulated":[410],"To":[420],"these":[422],"results,":[424],"need":[426],"develop":[428],"theory":[430],"(multicommodity)":[432],"flows":[433],"vertex":[437],"separators":[438],"case":[441],"when":[442],"function":[444],"b":[445],"(":[446],"S":[447,454],"defining":[449],"cost":[451],"separator":[453],"submodular,":[456],"independent":[461],"interest.":[462]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}