An FPT algorithm for Matching Cut

by   N. R. Aravind, et al.

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.


page 1

page 2

page 3

page 4


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...

Maximum Cut Parameterized by Crossing Number

Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...

Fixed-parameter tractability of counting small minimum (S,T)-cuts

The parameterized complexity of counting minimum cuts stands as a natura...

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction

The maximal k-edge-connected subgraphs problem is a classical graph clus...

A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time

In the non-uniform sparsest cut problem, we are given a supply graph G a...

A Weight-scaling Algorithm for f-factors of Multigraphs

We discuss combinatorial algorithms for finding a maximum weight f-facto...

An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization

We consider the black-box reduction from multi-dimensional revenue maxim...

Please sign up or login with your details

Forgot password? Click here to reset