
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
A matching cut is a partition of the vertex set of a graph into two sets...
read it

Maximum Cut Parameterized by Crossing Number
Given an edgeweighted graph G on n nodes, the NPhard MaxCut problem a...
read it

Fixedparameter tractability of counting small minimum (S,T)cuts
The parameterized complexity of counting minimum cuts stands as a natura...
read it

A Weightscaling Algorithm for ffactors of Multigraphs
We discuss combinatorial algorithms for finding a maximum weight ffacto...
read it

Randomized contractions meet lean decompositions
The randomized contractions technique, introduced by Chitnis et al. in 2...
read it

Sparsification of Balanced Directed Graphs
Sparsification, where the cut values of an input graph are approximately...
read it

An Efficient εBIC to BIC Transformation and Its Application to BlackBox Reduction in Revenue Maximization
We consider the blackbox reduction from multidimensional revenue maxim...
read it
An FPT algorithm for Matching Cut
In an undirected graph, a matching cut is an edge cut which is also a matching. we refer MATCHING CUT to the problem of deciding if a given graph contain a matching cut or not. For the matching cut problem, the size of the edge cut also known as the number of crossing edges is a natural parameter. Gomes et al. in <cit.> showed that MATCHING CUT is FPT when parameterized by maximum size of the edge cut using a reduction on results provided by Marx et. al <cit.>. However, they didn't provide an explicit bound on the running time as the treewidth reduction technique of <cit.> relies on a MSOL formulation for matching cut and Courcelle's Theorem <cit.> to show fixed parameter tractability. This motivated us to design an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit. In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O(2^O(klog k)n^O(1)). This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded.
READ FULL TEXT
Comments
There are no comments yet.