Edmonds' algorithm
Description: Edmonds' algorithm is a graph-theoretic method for finding an optimum branching, or directed spanning tree, in a directed graph.
Primary topic: Complexity and Algorithms in Graphs (58%)
Related topic: Complexity and Algorithms in Graphs (58%)
Wikidata ID: wiki/Q1752324
OpenAlex ID: keywords/edmonds-algorithm
