{"id":"https://openalex.org/W2964662878","doi":"https://doi.org/10.1109/lics.2019.8785682","title":"Canonisation and Definability for Graphs of Bounded Rank Width","display_name":"Canonisation and Definability for Graphs of Bounded Rank Width","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2964662878","doi":"https://doi.org/10.1109/lics.2019.8785682","mag":"2964662878"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785682","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-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/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"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":true,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008306814","display_name":"Daniel Neuen","orcid":"https://orcid.org/0000-0002-4940-0318"},"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":"Daniel Neuen","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073893026"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":2.5218,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.90529151,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"107","issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9997000098228455,"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.9991999864578247,"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/bounded-function","display_name":"Bounded function","score":0.7174029350280762},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5842846035957336},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43520379066467285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42699486017227173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42301779985427856},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3693755269050598},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.032926976680755615}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7174029350280762},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5842846035957336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43520379066467285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42699486017227173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42301779985427856},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3693755269050598},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.032926976680755615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2019.8785682","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W149380172","https://openalex.org/W1489366126","https://openalex.org/W1501904253","https://openalex.org/W1540331880","https://openalex.org/W1546876109","https://openalex.org/W1706559987","https://openalex.org/W1824706793","https://openalex.org/W1970629906","https://openalex.org/W1974672137","https://openalex.org/W1981539143","https://openalex.org/W1983330347","https://openalex.org/W1984890936","https://openalex.org/W1993328543","https://openalex.org/W1994887153","https://openalex.org/W2024420212","https://openalex.org/W2037713618","https://openalex.org/W2047871605","https://openalex.org/W2053991811","https://openalex.org/W2059144726","https://openalex.org/W2063063505","https://openalex.org/W2063951771","https://openalex.org/W2105223629","https://openalex.org/W2111302825","https://openalex.org/W2152035036","https://openalex.org/W2158308328","https://openalex.org/W2159366821","https://openalex.org/W2170114629","https://openalex.org/W2171491461","https://openalex.org/W2181072414","https://openalex.org/W2211319681","https://openalex.org/W2409645877","https://openalex.org/W2415388303","https://openalex.org/W2593190625","https://openalex.org/W2742552980","https://openalex.org/W2743930031","https://openalex.org/W2913482449","https://openalex.org/W2963366865","https://openalex.org/W2963545495","https://openalex.org/W2964662878","https://openalex.org/W2991150483","https://openalex.org/W3105529609","https://openalex.org/W4214702250","https://openalex.org/W4236835455","https://openalex.org/W4285719527","https://openalex.org/W4299645165","https://openalex.org/W6749635843","https://openalex.org/W6786544524"],"related_works":["https://openalex.org/W3080875783","https://openalex.org/W1978042415","https://openalex.org/W3086542228","https://openalex.org/W2088849544","https://openalex.org/W4234996786","https://openalex.org/W2017331178","https://openalex.org/W2963533204","https://openalex.org/W1871156538","https://openalex.org/W1999574685","https://openalex.org/W2980075598"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,59,139],"the":[3,16,39,78,122],"combinatorial":[4],"Weisfeiler-Leman":[5],"algorithm":[6,82,127],"of":[7,18,21,41,45,48,61,63,104,118,130,151],"dimension":[8],"(3k+4)":[9],"is":[10,29,51,67,121,138],"a":[11,30,42,84,92],"complete":[12],"isomorphism":[13,60,100],"test":[14,101],"for":[15,91,102,128],"class":[17],"all":[19,148],"graphs":[20,62,103,129],"rank":[22,64,105,132,153],"width":[23,28,40,65,106],"at":[24],"most":[25],"k.":[26],"Rank":[27],"graph":[31,149],"invariant":[32],"that,":[33],"similarly":[34],"to":[35,53],"tree":[36],"width,":[37],"measures":[38],"certain":[43],"style":[44],"hierarchical":[46],"decomposition":[47],"graphs;":[49],"it":[50],"equivalent":[52],"clique":[54],"width.":[55,133,154],"It":[56],"was":[57],"known":[58,81],"k":[66,107],"decidable":[68],"in":[69,109],"polynomial":[70,124,145],"time":[71,86,110,125,146],"(Grohe":[72],"and":[73],"Schweitzer,":[74],"FOCS":[75],"2015),":[76],"but":[77],"best":[79],"previously":[80],"has":[83],"running":[85,108],"n":[87,111],"<sup":[88,112],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[89,113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">f(k)</sup>":[90],"non-elementary":[93],"function":[94],"f.":[95],"Our":[96,134],"result":[97,120,137],"yields":[98],"an":[99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(k)</sup>":[114],".":[115],"Another":[116],"consequence":[117],"our":[119],"first":[123],"canonisation":[126],"bounded":[131,152],"second":[135],"main":[136],"fixed-point":[140],"logic":[141],"with":[142],"counting":[143],"captures":[144],"on":[147],"classes":[150]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}