7 citations · 44 across the 35 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
Nicolas {El Maalouly}, Raphael Steiner, Lasse Wulf
Given an integer and a graph where every edge is colored either red or blue, the goal of the exact matching problem is to find a perfect matching with the property that exactly…
cs.DS2022
Exact Matching in Graphs of Bounded Independence Number
Nicolas El Maalouly, Raphael Steiner
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges with two colors (red and blue), as well as a positive integer . The task is…