A polynomial kernel for vertex deletion into bipartite permutation graphs

11/27/2021
by   Jan Derbisz, et al.
0

A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines ℓ_1 and ℓ_2, one on each. A bipartite permutation graph is a permutation graph which is bipartite. In the the bipartite permutation vertex deletion problem we ask for a given n-vertex graph, whether we can remove at most k vertices to obtain a bipartite permutation graph. This problem is NP-complete but it does admit an FPT algorithm parameterized by k. In this paper we study the kernelization of this problem and show that it admits a polynomial kernel with O(k^99) vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/22/2020

Vertex deletion into bipartite permutation graphs

A permutation graph can be defined as an intersection graph of segments ...
11/17/2021

Roman Domination in Convex Bipartite Graphs

In the Roman domination problem, an undirected simple graph G(V,E) is gi...
06/08/2020

Vertex removal in biclique graphs

A biclique is a maximal bipartite complete induced subgraph. The bicliqu...
01/11/2022

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs

Eternal Vertex Cover problem is a dynamic variant of the vertex cover pr...
03/14/2018

Max-Min Greedy Matching

A bipartite graph G(U,V;E) that admits a perfect matching is given. One ...
03/26/2020

A Blind Permutation Similarity Algorithm

This paper introduces a polynomial blind algorithm that determines when ...
03/30/2021

Applications of Common Information to Computing Functions

We design a low complexity distributed compression scheme for computing ...