Keywords

#matroid_parity_problem

Matroid parity problem

Largest independent set of paired elements

In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid. The problem was formulated by Lawler (1976) as a common generalization of graph matching and matroid intersection. It is also known as polymatroid matching, or the matchoid problem.

Sat 6th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Matroid parity problem Delta-matroid Matroid intersection List of unsolved problems in mathematics Block graph Xuong tree Tuza's conjecture Feedback vertex set Connected dominating set Cactus graph
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.