{"id":"https://openalex.org/keywords/edmonds-algorithm","display_name":"Edmonds' algorithm","description":"Edmonds' algorithm is a graph-theoretic method for finding an optimum branching, or directed spanning tree, in a directed graph.","display_name_alternatives":["Chu\u2013Liu/Edmonds' algorithm","Chu-Liu algorithm","Edmonds' branching algorithm","optimum branching algorithm"],"ids":{"openalex":"https://openalex.org/keywords/edmonds-algorithm","wikidata":"https://www.wikidata.org/wiki/Q1752324"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5756,"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.5756,"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":108,"cited_by_count":1612,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/edmonds-algorithm","updated_date":"2026-11-15T04:06:23","created_date":"2022-04-12T19:38:12"}
