{"id":"https://openalex.org/keywords/cutwidth","display_name":"cutwidth","description":"A graph-theoretic parameter measuring the minimum, over vertex orderings, of the maximum number of edges crossing a division between consecutive vertices.","display_name_alternatives":["folding number","cut width"],"ids":{"openalex":"https://openalex.org/keywords/cutwidth","wikidata":"https://www.wikidata.org/wiki/Q110772608"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.664,"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.664,"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.1273,"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"}}],"works_count":233,"cited_by_count":4525,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/cutwidth","updated_date":"2026-11-22T04:06:09","created_date":"2026-09-30T00:00:00"}
