Karp--Sipser for hypergraphs

Karp--Sipser based heuristics for the maximum cardinality matching problem in d-uniform, d-partite hypergraphs.