{"id":"https://openalex.org/W7134057085","doi":"https://doi.org/10.1145/3798282","title":"Computational Complexity of the Weisfeiler-Leman Dimension","display_name":"Computational Complexity of the Weisfeiler-Leman Dimension","publication_year":2026,"publication_date":"2026-03-06","ids":{"openalex":"https://openalex.org/W7134057085","doi":"https://doi.org/10.1145/3798282"},"language":"en","primary_location":{"id":"doi:10.1145/3798282","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798282","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"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":"ACM Transactions on Computational Logic","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/A5050723678","display_name":"Moritz Lichter","orcid":"https://orcid.org/0000-0001-5437-8074"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Moritz Lichter","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5437-8074","affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128228492","display_name":"Simon Rassmann","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Simon Ra\u00dfmann","raw_affiliation_strings":["TU Darmstadt, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1685-410X","affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017685495","display_name":"Pascal Schweitzer","orcid":"https://orcid.org/0009-0001-3585-8213"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pascal Schweitzer","raw_affiliation_strings":["TU Darmstadt, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0009-0001-3585-8213","affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28713818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"2","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.3431999981403351,"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.3431999981403351,"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.18029999732971191,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.15850000083446503,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8245999813079834},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6078000068664551},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5812000036239624},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.5016999840736389},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4706000089645386},{"id":"https://openalex.org/keywords/vc-dimension","display_name":"VC dimension","score":0.4131999909877777},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41019999980926514},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.36480000615119934}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8245999813079834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6941999793052673},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6078000068664551},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5812000036239624},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.5016999840736389},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4706000089645386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4586000144481659},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4408000111579895},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.362199991941452},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C115311070","wikidata":"https://www.wikidata.org/wiki/Q5347255","display_name":"Effective dimension","level":3,"score":0.3255000114440918},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3109000027179718},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31049999594688416},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C168185519","wikidata":"https://www.wikidata.org/wiki/Q5156577","display_name":"Complex dimension","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C183763347","wikidata":"https://www.wikidata.org/wiki/Q120976","display_name":"Factorial","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798282","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798282","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1987973509","display_name":"Symmetry and Similarity","funder_award_id":"101054974","funder_id":"https://openalex.org/F4320338453","funder_display_name":"HORIZON EUROPE European Research Council"},{"id":"https://openalex.org/G4079329070","display_name":"Next generation algorithms for grabbing and exploiting symmetry","funder_award_id":"820148","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338453","display_name":"HORIZON EUROPE European Research Council","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W12328562","https://openalex.org/W157368094","https://openalex.org/W165726963","https://openalex.org/W1501904253","https://openalex.org/W1687588989","https://openalex.org/W1853910520","https://openalex.org/W1979481247","https://openalex.org/W1982347904","https://openalex.org/W1990600049","https://openalex.org/W2011911122","https://openalex.org/W2017024025","https://openalex.org/W2045027298","https://openalex.org/W2059372025","https://openalex.org/W2067297906","https://openalex.org/W2087083200","https://openalex.org/W2111119215","https://openalex.org/W2111302825","https://openalex.org/W2119446222","https://openalex.org/W2152035036","https://openalex.org/W2173290940","https://openalex.org/W2181072414","https://openalex.org/W2296150830","https://openalex.org/W2409645877","https://openalex.org/W2524594508","https://openalex.org/W2913482449","https://openalex.org/W2922213978","https://openalex.org/W2962810718","https://openalex.org/W2963312335","https://openalex.org/W2963675331","https://openalex.org/W2991150483","https://openalex.org/W3157423416","https://openalex.org/W3193325593","https://openalex.org/W3196303094","https://openalex.org/W3208077660","https://openalex.org/W4390098001","https://openalex.org/W4412227031","https://openalex.org/W7109956467"],"related_works":[],"abstract_inverted_index":{"The":[0,54],"Weisfeiler-Leman":[1,23,90,98,148,267],"dimension":[2,55,99,149],"of":[3,60,66,79,87,100,130,150,222,255],"a":[4,57,67,141,151,210],"graph":[5,68,153,234],"\\(":[6,13,19,26,38,43,101,107,115,161,195],"G":[7,27,44,102,116],"\\)":[8,15,21,28,40,45,103,109,117,163,197],"is":[9,46,56,104,110,118,158,177,182],"the":[10,18,36,61,77,85,89,97,131,147,173,180,199,215,233,253,266],"least":[11,37],"number":[12],"k":[14,20,39,108,162],"such":[16,41],"that":[17,42,94,144,168,218],"-dimensional":[22],"algorithm":[24,143,213],"distinguishes":[25],"from":[29],"every":[30],"other":[31],"non-isomorphic":[32],"graph,":[33],"or":[34,63],"equivalently,":[35],"definable":[47],"in":[48,74,76],"\\((k+1)\\)":[49],"-variable":[50],"logic":[51],"with":[52,154,243],"counting.":[53],"standard":[58],"measure":[59],"descriptive":[62],"structural":[64],"complexity":[65,86],"and":[69,202,249,261],"recently":[70],"finds":[71],"various":[72],"applications":[73],"particular":[75],"context":[78],"machine":[80],"learning.":[81],"This":[82],"article":[83],"studies":[84],"computing":[88],"dimension.":[91],"We":[92],"observe":[93],"deciding":[95],"whether":[96,146],"at":[105,159],"most":[106,160],"NP":[111],"-hard,":[112],"even":[113],"if":[114],"restricted":[119],"to":[120,265],"have":[121],"4-bounded":[122,244],"color":[123,156,174,200,225],"classes.":[124],"Therefore,":[125],"we":[126,139,166,208,236],"study":[127],"parameterized":[128],"versions":[129],"problem.":[132],"For":[133],"each":[134,192,203,224],"fixed":[135,204],"\\(k\\geq":[136,205],"2\\)":[137,206],",":[138,207],"give":[140],"polynomial-time":[142,211],"decides":[145],"given":[152],"5-bounded":[155],"classes":[157,201,235],".":[164],"Moreover,":[165],"show":[167],"for":[169,191,214,220],"these":[170],"bounds":[171,263],"on":[172,198],"classes,":[175],"this":[176],"optimal":[178],"because":[179],"problem":[181],"P":[183],"-hard":[184],"under":[185],"logspace-uniform":[186],"AC":[187],"0":[188],"-reductions.":[189],"Furthermore,":[190],"larger":[193],"bound":[194],"c":[196],"provide":[209],"decision":[212],"abelian":[216,229,245],"case,":[217],"is,":[219],"structures":[221],"which":[223,251],"class":[226],"has":[227],"an":[228],"automorphism":[230],"group.":[231],"While":[232],"consider":[237],"may":[238],"seem":[239],"quite":[240],"restrictive,":[241],"graphs":[242],"colors":[246],"include":[247],"CFI-graphs":[248],"multipedes,":[250],"form":[252],"basis":[254],"almost":[256],"all":[257],"known":[258],"hard":[259],"instances":[260],"lower":[262],"related":[264],"algorithm.":[268]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-03-07T00:00:00"}