5 citations · 6 across the 5 of their papers we have counts for
1 paper · 1 filter
Felix Hommelsheim, Pia Jehmlich, Moritz Mühlenthaler
Given an edge-colored graph, the Maximum Rainbow Matching problem asks for a maximum-cardinality matching of the graph that contains at most one edge from each color. We provide th…