Reducing Rank of the Adjacency Matrix by Graph Modification

The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices (edges) so that the resulting graph belongs to a particular family, \(\mathcal F\), of graphs. In general the family \(\mathcal F\) is defined by forbidden subgraph/minor characterization. In this paper rather than taking a structural route to define \(\mathcal F\), we take algebraic route. More formally, given a fixed positive integer r, we define \(\mathcal{F}_r\) as the family of graphs where for each \(G\in \mathcal{F}_r\), the rank of the adjacency matrix of G is at most r. Using the family \(\mathcal{F}_r\) we initiate algorithmic study, both in classical and parameterized complexity, of following graph modification problems: \(r\)-Rank Vertex Deletion, \(r\)-Rank Edge Deletion and \(r\)-Rank Editing. These problems generalize the classical Vertex Cover problem and a variant of the d -Cluster Editing problem. We first show that all the three problems are NP-Complete. Then we show that these problems are fixed parameter tractable (FPT) by designing an algorithm with running time \(2^{\mathcal{O}(k \log r)}n^{\mathcal{O}(1)}\) for \(r\)-Rank Vertex Deletion, and an algorithm for \(r\)-Rank Edge Deletion and \(r\)-Rank Editing running in time \(2^{\mathcal{O}(f(r) \sqrt{k} \log k )}n^{\mathcal{O}(1)}\). We complement our FPT result by designing polynomial kernels for these problems.

[1]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[2]  Jiong Guo,et al.  A More Effective Linear Kernelization for Cluster Editing , 2007, ESCAPE.

[3]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[4]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[5]  Flavia Bonomo,et al.  NP-completeness results for edge modification problems , 2006, Discret. Appl. Math..

[6]  Fedor V. Fomin,et al.  Subexponential parameterized algorithm for minimum fill-in , 2011, SODA.

[7]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[8]  Peter Damaschke,et al.  Editing the Simplest Graphs , 2014, WALCOM.

[9]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[10]  Michal Pilipczuk,et al.  Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters , 2014, J. Comput. Syst. Sci..

[11]  László Lovász,et al.  The rank and size of graphs , 1996 .

[12]  Christian Komusiewicz,et al.  Fixed-Parameter Algorithms for Cluster Vertex Deletion , 2010, Theory of Computing Systems.

[13]  Roded Sharan,et al.  Cluster graph modification problems , 2002, Discret. Appl. Math..

[14]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.