{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","description":"A partition of a graph's vertices into separate sets whose crossing edges have minimum total weight or capacity.","display_name_alternatives":["min-cut","mincut","minimum graph cut","minimum cuts","minimal cuts"],"ids":{"openalex":"https://openalex.org/keywords/minimum-cut","wikidata":"https://www.wikidata.org/wiki/Q6865438"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3819,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3819,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.0805,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":2319,"cited_by_count":53638,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/minimum-cut","updated_date":"2026-11-16T04:05:30","created_date":"2022-04-12T19:38:12"}
