DeepAI AI Chat
Log In Sign Up

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

by   Pierre Bergé, et al.
Laboratoire de Recherche en Informatique (LRI)

The parameterized complexity of counting minimum cuts stands as a natural question because Ball and Provan showed its #P-completeness. For any undirected graph G=(V,E) and two disjoint sets of its vertices S,T, we design a fixed-parameter tractable algorithm which counts minimum edge (S,T)-cuts parameterized by their size p. Our algorithm operates on a transformed graph instance. This transformation, called drainage, reveals a collection of at most n=| V | successive minimum (S,T)-cuts Z_i. We prove that any minimum (S,T)-cut X contains edges of at least one cut Z_i. This observation, together with Menger's theorem, allows us to build the algorithm counting all minimum (S,T)-cuts with running time 2^O(p^2)n^O(1). Initially dedicated to counting minimum cuts, it can be modified to obtain an FPT sampling of minimum edge (S,T)-cuts.


page 1

page 2

page 3

page 4


On the Parameterized Complexity of k-Edge Colouring

For every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-p...

An FPT algorithm for Matching Cut

In an undirected graph, a matching cut is an edge cut which is also a ma...

Parameterized Complexity of Upper Edge Domination

In this paper we study a maximization version of the classical Edge Domi...

Shared-memory Exact Minimum Cuts

The minimum cut problem for an undirected edge-weighted graph asks us to...

An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion

A 2-club is a graph of diameter at most two. In the decision version of ...

Covering vectors by spaces: Regular matroids

Seymour's decomposition theorem for regular matroids is a fundamental re...

Recursive Random Contraction Revisited

In this note, we revisit the recursive random contraction algorithm of K...