{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","description":"Maximum flow is a graph-theoretic optimization problem that finds the greatest feasible quantity of flow from a source to a destination in a network.","display_name_alternatives":["maximum flow problem","max-flow problem","maximum network flow","maximal flow","max flow"],"ids":{"openalex":"https://openalex.org/keywords/maximum-flow","wikidata":"https://www.wikidata.org/wiki/Q2585642"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4699,"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.4699,"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":4481,"cited_by_count":90368,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/maximum-flow","updated_date":"2026-10-25T04:06:18","created_date":"2026-09-30T00:00:00"}