Imbalance Parameterized by Twin Cover Revisited

05/07/2020
by   Neeldhara Misra, et al.
0

We study the problem of Imbalance parameterized by the twin cover of a graph. We show that Imbalance is XP parameterized by twin cover, and FPT when parameterized by the twin cover and the size of the largest clique outside the twin cover. In contrast, we introduce a notion of succinct representations of graphs in terms of their twin cover and demonstrate that Imbalance is NP-hard in the setting of succinct representations, even for graphs that have a twin cover of size one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2021

Defensive Alliances in Graphs

A set S of vertices of a graph is a defensive alliance if, for each elem...
research
02/04/2022

Globally Minimal Defensive Alliances: A Parameterized Perspective

A defensive alliance in an undirected graph G=(V,E) is a non-empty set o...
research
03/18/2023

On the Parameterized Complexity of Relaxations of Clique

We investigate the parameterized complexity of several problems formaliz...
research
08/22/2021

Clique Cover of Graphs with Bounded Degeneracy

Structural parameters of graph (such as degeneracy and arboricity) had r...
research
06/14/2019

Exact Crossing Number Parameterized by Vertex Cover

We prove that the exact crossing number of a graph can be efficiently co...
research
02/19/2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals

Perturbed graphic matroids are binary matroids that can be obtained from...
research
02/15/2023

Quantifying gender imbalance in East Asian academia

Gender imbalance in academia has been confirmed in terms of a variety of...

Please sign up or login with your details

Forgot password? Click here to reset