Answers are grounded in this paper and cite their sources.
Edmonds [1] has given an algorithm for constructing a maximum‐weight branching in a weighted directed graph. His proof that the algorithm is correct is based on linear programming theory, and establishes as a by‐product that a certain polyhedron has integer vertices. Here we give a direct combinatorial proof of the correctness of the algorithm.
No takes yet. Share an insight, caveat, or question.
Richard M. Karp (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: