activity
20092023
most citedRefined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

2 citations · 5 across the 9 of their papers we have counts for

collaborators
Showing 2018 · cs.CCShow all

1 paper · 2 filters

cs.CC2018

A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

Hoang-Oanh Le, Van Bang Le

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-compl…