Bounded-Degree Cut is Fixed-Parameter Tractable

by   Mingyu Xiao, et al.

In the bounded-degree cut problem, we are given a multigraph G=(V,E), two disjoint vertex subsets A,B⊆ V, two functions u_A, u_B:V→{0,1,…,|E|} on V, and an integer k≥ 0. The task is to determine whether there is a minimal (A,B)-cut (V_A,V_B) of size at most k such that the degree of each vertex v∈ V_A in the induced subgraph G[V_A] is at most u_A(v) and the degree of each vertex v∈ V_B in the induced subgraph G[V_B] is at most u_B(v). In this paper, we show that the bounded-degree cut problem is fixed-parameter tractable by giving a 2^18k|G|^O(1)-time algorithm. This is the first single exponential FPT algorithm for this problem. The core of the algorithm lies two new lemmas based on important cuts, which give some upper bounds on the number of candidates for vertex subsets in one part of a minimal cut satisfying some properties. These lemmas can be used to design fixed-parameter tractable algorithms for more related problems.



There are no comments yet.


page 1

page 2

page 3

page 4


Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs

We design the first subexponential-time (parameterized) algorithms for s...

Deobfuscating sparse graphs

We construct a fixed parameter algorithm parameterized by d and k that t...

Directed flow-augmentation

We show a flow-augmentation algorithm in directed graphs: There exists a...

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints

A property Π on a finite set U is monotone if for every X ⊆ U satisfying...

An O^*(1.84^k) Parameterized Algorithm for the Multiterminal Cut Problem

We study the multiterminal cut problem, which, given an n-vertex graph w...

Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks

The asynchronous rumor algorithm spreading propagates a piece of informa...

Compression with wildcards: All exact, or all minimal hitting sets

Our main objective is the COMPRESSED enumeration (based on wildcards) of...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.