Matroid intersection is a concept in combinatorial optimization and matroid theory that deals with the intersection of two matroids on a common ground set. Matroids are algebraic structures that generalize the notion of linear independence in vector spaces.
Articles by others on the same topic
There are currently no matching articles.