On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
For directed and undirected graphs, we study the problem to make a distinguished vertex the unique minimum-(in)degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis. Continuing previous work for the directed case, we show that the problem is W-hard when parameterized by the graph’s feedback arc set number, whereas it becomes fixed-parameter tractable when combining the parameters “feedback vertex set number” and “number of vertices to delete”. For the so far unstudied undirected case, we show that the problem is NP-hard and W-hard when parameterized by the “number of vertices to delete”. On the positive side, we show fixed-parameter tractability for several parameterizations measuring tree-likeness, including a vertex-linear problem kernel with respect to the parameter “feedback edge set number”. On the contrary, we show a non-existence result concerning polynomial-size problem kernels for the combined parameter “vertex cover number and number of vertices to delete”, implying corresponding nonexistence results when replacing vertex cover number by treewidth or feedback vertex set number.
KeywordsSocial Network Analysis Vertex Cover Polynomial Kernel Tractability Result Vertex Deletion
Unable to display preview. Download preview PDF.
- 1.Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: The maximum k-plex problem. Oper. Res. (2010) (to appear)Google Scholar
- 5.Bodlaender, H.L., Thomassé, S., Yeo, A.: Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels. Technical Report UU-CS-2008-030, Department of Information and Computing Sciences, Utrecht University (2008)Google Scholar
- 6.Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science. Formal Models and Sematics (B), vol. B, pp. 193–242 (1990)Google Scholar
- 10.Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter’s local optimization theorem. In: Proc. 26th STACS, pp. 409–420. IBFI Dagstuhl, Germany (2009)Google Scholar
- 13.Huberman, B.A., Romero, D.M., Wu, F.: Social networks that matter: Twitter under the microscope. First Monday 14(1) (2009)Google Scholar
- 14.Moser, H., Niedermeier, R., Sorge, M.: Algorithms and experiments for clique relaxations—finding maximum s-plexes. In: Proc. 8th SEA. LNCS, vol. 5526, pp. 233–244. Springer, Heidelberg (2009)Google Scholar
- 17.Romm-Livermore, C., Setzekorn, K.: Social Networking Communities and E-Dating Services: Concepts and Implications. Information Science Reference (2008)Google Scholar