Deleting k colors to place the residual augmented graph in a uniformly rank-r exact hereditary class yields Lasserre exactness at level k+r, with color-intersection graphs inducing clique-sum locality for blockwise algorithms on rainbow matching.
Parameterized algorithms and kernels for rainbow matching.Algorithmica, 81(4):1684–1698, 2019
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Maximum Rainbow Matching is polynomial-time solvable if almost every color class is complete multipartite and NP-hard otherwise.
citing papers explorer
-
Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching
Deleting k colors to place the residual augmented graph in a uniformly rank-r exact hereditary class yields Lasserre exactness at level k+r, with color-intersection graphs inducing clique-sum locality for blockwise algorithms on rainbow matching.
-
A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
Maximum Rainbow Matching is polynomial-time solvable if almost every color class is complete multipartite and NP-hard otherwise.