{"id":"https://openalex.org/keywords/edmonds-karp-algorithm","display_name":"Edmonds-Karp algorithm","description":"The Edmonds-Karp algorithm is a graph algorithm for finding a maximum flow in a network, using breadth-first search to select augmenting paths.","display_name_alternatives":["Edmonds-Karp","Edmonds\u2013Karp maximum flow algorithm"],"ids":{"openalex":"https://openalex.org/keywords/edmonds-karp-algorithm","wikidata":"https://www.wikidata.org/wiki/Q1302658"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5787,"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.5787,"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":160,"cited_by_count":1702,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/edmonds-karp-algorithm","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
