Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akbari, S., Cameron, P.J., Khosrovshahi, G.B.: Ranks and signatures of adjacency matrices (2004)
Burzyn, P., Bonomo, F., Durán, G.: Np-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824–1844 (2006)
Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)
Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. In: STACS, pp. 214–225 (2014)
Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Transactions on Algorithms (TALG) 11(3), 21 (2015)
Damaschke, P., Mogren, O.: Editing the simplest graphs. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 249–260. Springer, Heidelberg (2014)
Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Journal of Computer and System Sciences 80(7), 1430–1447 (2014)
Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. SIAM Journal on Computing 42(6), 2197–2216 (2013)
Guo, J.: A more effective linear kernelization for cluster editing. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 36–47. Springer, Heidelberg (2007)
Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory of Computing Systems 47(1) (2010)
Jukna, S.: Extremal combinatorics: with applications in computer science. Springer Science & Business Media (2011)
Kotlov, A., Lovász, L.: The rank and size of graphs. Journal of Graph Theory 23(2), 185–189 (1996)
Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. Journal of Computer and System Sciences 20(2), 219–230 (1980)
Peeters, R.: The maximum edge biclique problem is np-complete. Discrete Applied Mathematics 131(3), 651–654 (2003)
Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299–301 (2004)
Robertson, N., Seymour, P.D.: Graph minors. xiii. the disjoint paths problem. Journal of Combinatorial Theory, Series B 63(1), 65–110 (1995)
Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1-2) (2004)
Yannakakis, M.: Node-and edge-deletion np-complete problems. In: STOC, pp. 253–264. ACM (1978)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Meesum, S.M., Misra, P., Saurabh, S. (2015). Reducing Rank of the Adjacency Matrix by Graph Modification. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)