Edmonds' matroid intersection algorithm
E1739865
UNEXPLORED
Edmonds' matroid intersection algorithm is a foundational combinatorial optimization method that efficiently finds a largest common independent set of two matroids on the same ground set.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Edmonds' matroid intersection algorithm canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.