Aug 10, 2018 · In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem.

Abstract. In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem.

Dec 1, 2017 · Abstract. In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem.

In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem.

This paper develops a deterministic algorithm that solves Rainbow Matching on paths in time O⋆1+52k and a randomized algorithm that solves Rainbow Matching ...

We show that the problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by the solution size $k$. In particular, we show that it ...

In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem.

Jul 14, 2022 · Abstract. We introduce a new kernelization tool, called rainbow matching technique, that is appropriate for the design of polynomial kernels ...

Parameterized Algorithms and Kernels for Rainbow Matching. https://doi.org/10.1007/s00453-018-0497-3 ·. Journal: Algorithmica, 2018, № 4, p. 1684-1698.

In this paper, we study the NP-complete colorful variant of the classical Matching problem, namely, the Rainbow Matching problem.