Explore relationships

Matroid partitioning

Matroid partitioning is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms. Its goal is to partition the elements of a matroid into as few independent sets as possible.

Use + to expand a branch. Click a topic name to open its summary.