2 citations · 2 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DM2021
The Perfect Matching Cut Problem Revisited
Van Bang Le, Jan Arne Telle
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut…
cs.DS2021★ 2 cited
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch +1
An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into…