Parameterized Complexity of Upper Edge Domination

by   Ajinkya Gaikwad, et al.

In this paper we study a maximization version of the classical Edge Dominating Set (EDS) problem, namely, the Upper EDS problem, in the realm of Parameterized Complexity. In this problem, given an undirected graph G, a positive integer k, the question is to check whether G has a minimal edge dominating set of size at least k. We obtain the following results for Upper EDS. We prove that Upper EDS admits a kernel with at most 4k^2-2 vertices. We also design a fixed-parameter tractable (FPT) algorithm for Upper EDS running in time 2^π’ͺ(k)Β· n^π’ͺ(1).


page 1

page 2

page 3

page 4

βˆ™ 08/03/2022

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective

In this paper we study a maximization version of the classical Feedback ...
βˆ™ 01/07/2019

On the Parameterized Complexity of k-Edge Colouring

For every fixed integer k β‰₯ 1, we prove that k-Edge Colouring is fixed-p...
βˆ™ 10/01/2019

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

In a reconfiguration version of an optimization problem Q the input is a...
βˆ™ 11/11/2022

A parameterized halting problem, Ξ”_0 truth and the MRDP theorem

We study the parameterized complexity of the problem to decide whether a...
βˆ™ 01/19/2021

Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation

An upper dominating set is a minimal dominating set in a graph. In the U...
βˆ™ 07/04/2019

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

The parameterized complexity of counting minimum cuts stands as a natura...
βˆ™ 07/14/2020

Component Order Connectivity in Directed Graphs

A directed graph D is semicomplete if for every pair x,y of vertices of ...

Please sign up or login with your details

Forgot password? Click here to reset