A polynomial kernel for vertex deletion into bipartite permutation graphs

by   Jan Derbisz, et al.

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.


page 1

page 2

page 3

page 4


Vertex deletion into bipartite permutation graphs

A permutation graph can be defined as an intersection graph of segments ...

Roman Domination in Convex Bipartite Graphs

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

Vertex removal in biclique graphs

A biclique is a maximal bipartite complete induced subgraph. The bicliqu...

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs

Eternal Vertex Cover problem is a dynamic variant of the vertex cover pr...

Max-Min Greedy Matching

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

A Blind Permutation Similarity Algorithm

This paper introduces a polynomial blind algorithm that determines when ...

Applications of Common Information to Computing Functions

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