Edmonds' branching algorithm for optimum branchings
E1739867
UNEXPLORED
Edmonds' branching algorithm for optimum branchings is a foundational combinatorial optimization algorithm that efficiently finds maximum or minimum weight directed spanning trees (branchings) in a directed graph.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Edmonds' branching algorithm for optimum branchings canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.