{"id":"https://openalex.org/W1135667589","doi":"https://doi.org/10.1145/3132720","title":"Canonizing Graphs of Bounded Tree Width in Logspace","display_name":"Canonizing Graphs of Bounded Tree Width in Logspace","publication_year":2017,"publication_date":"2017-09-30","ids":{"openalex":"https://openalex.org/W1135667589","doi":"https://doi.org/10.1145/3132720","mag":"1135667589"},"language":"en","primary_location":{"id":"doi:10.1145/3132720","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3132720","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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/A5031690987","display_name":"Michael Elberfeld","orcid":null},"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":"Michael Elberfeld","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany","RWTH-Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"RWTH-Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"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/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":"Pascal Schweitzer","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany","RWTH-Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7178,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.70716267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"3","first_page":"1","last_page":"29"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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/mathematics","display_name":"Mathematics","score":0.7308595776557922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7074362635612488},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6613489985466003},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6315150260925293},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6215729713439941},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5654506087303162},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.550207793712616},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4874744415283203},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41337448358535767},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4037732481956482},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40184712409973145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1310962736606598},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11469772458076477}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7308595776557922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7074362635612488},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6613489985466003},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6315150260925293},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6215729713439941},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5654506087303162},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.550207793712616},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4874744415283203},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41337448358535767},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4037732481956482},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40184712409973145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1310962736606598},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11469772458076477},{"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/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3132720","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3132720","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W69421514","https://openalex.org/W98565281","https://openalex.org/W1490189322","https://openalex.org/W1571206720","https://openalex.org/W1658031827","https://openalex.org/W1985953373","https://openalex.org/W1987393587","https://openalex.org/W1989887898","https://openalex.org/W1991005941","https://openalex.org/W1998084650","https://openalex.org/W2006771561","https://openalex.org/W2015413218","https://openalex.org/W2016588822","https://openalex.org/W2018099718","https://openalex.org/W2018806678","https://openalex.org/W2024420212","https://openalex.org/W2026005637","https://openalex.org/W2045027298","https://openalex.org/W2046021036","https://openalex.org/W2049516232","https://openalex.org/W2052024655","https://openalex.org/W2064343909","https://openalex.org/W2064710033","https://openalex.org/W2066447087","https://openalex.org/W2077202644","https://openalex.org/W2119468705","https://openalex.org/W2127563879","https://openalex.org/W2128706193","https://openalex.org/W2129003155","https://openalex.org/W2159366821","https://openalex.org/W2253740506","https://openalex.org/W2409645877","https://openalex.org/W2765834559","https://openalex.org/W2963091559","https://openalex.org/W3039948875"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W1258892498","https://openalex.org/W1587078595","https://openalex.org/W2124176527","https://openalex.org/W1522618089","https://openalex.org/W2985636744","https://openalex.org/W2125058377","https://openalex.org/W2465927132","https://openalex.org/W4360838296","https://openalex.org/W4387667086"],"abstract_inverted_index":{"Graph":[0],"canonization":[1],"is":[2],"the":[3,13,51,66,75,81,92,99,102],"problem":[4,53,104],"of":[5,16,37,56,68,84,86,91,95,101],"computing":[6],"a":[7,10,17],"unique":[8],"representative,":[9],"canon,":[11],"from":[12],"isomorphism":[14,52,69,103],"class":[15,77,83],"given":[18],"graph.":[19],"This":[20,48],"implies":[21,49],"that":[22,35,50],"two":[23],"graphs":[24,36,55,85,96],"are":[25,31],"isomorphic":[26],"exactly":[27,107],"if":[28],"their":[29],"canons":[30],"equal.":[32],"We":[33],"show":[34],"bounded":[38,57,87],"tree":[39,58,88],"width":[40,59,89],"can":[41,60],"be":[42,61],"canonized":[43],"by":[44],"logarithmic-space":[45],"(logspace)":[46],"algorithms.":[47],"for":[54,70,74,97],"decided":[62],"in":[63],"logspace.":[64],"In":[65],"light":[67],"trees":[71],"being":[72],"hard":[73],"complexity":[76,100],"logspace,":[78],"this":[79],"makes":[80],"ubiquitous":[82],"one":[90],"few":[93],"classes":[94],"which":[98],"has":[105],"been":[106],"determined.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}