Edmonds' algorithm, also called the Chu-Liu/Edmonds algorithm, finds a spanning arborescence of minimum weight in a directed graph, the directed counterpart of the minimum spanning tree problem. It was proposed independently by Yoeng-Jin Chu and Tseng-Hong Liu in 1965 and by Jack Edmonds in 1967.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.