There are polynomial algorithms for finding a maximum weighted matching on a bipartite graph, e.g. the hungarian algorithm. Is there such an algorithm for a tripartite 3-uniform hypergraph? What about a k-partite k-uniform hypergraph?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|
It turns out that this is called 3-dimensional matching, and it's known to be an NP-hard problem. So the answer is no. |
|||
|
|
