On the fixed-parameter tractability of the maximum connectivity improvement problem

04/26/2019
by   Federico Corò, et al.
0

In the Maximum Connectivity Improvement (MCI) problem, we are given a directed graph G=(V,E) and an integer B and we are asked to find B new edges to be added to G in order to maximize the number of connected pairs of vertices in the resulting graph. The MCI problem has been studied from the approximation point of view. In this paper, we approach it from the parameterized complexity perspective in the case of directed acyclic graphs. We show several hardness and algorithmic results with respect to different natural parameters. Our main result is that the problem is W[2]-hard for parameter B and it is FPT for parameters |V| - B and ν, the matching number of G. We further characterize the MCI problem with respect to other complementary parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/03/2021

The Parameterized Complexity of the Survivable Network Design Problem

For the well-known Survivable Network Design Problem (SNDP) we are given...
research
05/02/2023

On reversing arcs to improve arc-connectivity

We show that if the arc-connectivity of a directed graph D is at most ⌊k...
research
09/13/2021

On the Parameterized Complexity of the Acyclic Matching Problem

A matching is a set of edges in a graph with no common endpoint. A match...
research
10/02/2017

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

We study the Steiner Tree problem, in which a set of terminal vertices n...
research
04/10/2023

Digraph Colouring and Arc-Connectivity

The dichromatic number χ⃗(D) of a digraph D is the minimum size of a par...
research
02/28/2018

Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

We consider the Shallow-Light Steiner Network problem from a fixed-param...
research
11/21/2019

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters

We continue and extend previous work on the parameterized complexity ana...

Please sign up or login with your details

Forgot password? Click here to reset