
Finding Efficient Domination for P_8Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
read it

A fast new algorithm for weak graph regularity
We provide a deterministic algorithm that finds, in ϵ^O(1) n^2 time, an...
read it

A spectral method for bipartizing a network and detecting a large anticommunity
Relations between discrete quantities such as people, genes, or streets ...
read it

Applications of Common Information to Computing Functions
We design a low complexity distributed compression scheme for computing ...
read it

The Four Point Permutation Test for Latent Block Structure in Incidence Matrices
Transactional data may be represented as a bipartite graph G:=(L ∪ R, E)...
read it

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

A Blind Permutation Similarity Algorithm
This paper introduces a polynomial blind algorithm that determines when ...
read it
Vertex deletion into bipartite permutation graphs
A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines l_1 and l_2, one on each. A bipartite permutation graph is a permutation graph which is bipartite. In this paper we study the parameterized complexity of the bipartite permutation vertex deletion problem, which asks, for a given nvertex graph, whether we can remove at most k vertices to obtain a bipartite permutation graph. This problem is NPcomplete by the classical result of Lewis and Yannakakis. We analyze the structure of the socalled almost bipartite permutation graphs which may contain holes (large induced cycles) in contrast to bipartite permutation graphs. We exploit the structural properties of the shortest hole in a such graph. We use it to obtain an algorithm for the bipartite permutation vertex deletion problem with running time O(9^k· n^9), and also give a polynomialtime 9approximation algorithm.
READ FULL TEXT
Comments
There are no comments yet.