Abstract
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving NP-hard minimization problems. The core issue (particularly but not only motivated by iterative compression) is to determine the computational complexity of the following task: given an already inclusion-minimal solution for an underlying (typically NP-hard) vertex deletion problem in graphs, find a smaller disjoint solution. The complexity of this task is so far lacking a systematic study. We consider a large class of vertex deletion problems on undirected graphs and show that a few cases are polynomial-time solvable, and the others are NP-hard. The considered class of vertex deletion problems includes Vertex Cover (where the compression task is polynomial time) and Undirected Feedback Vertex Set (where the compression task is NP-complete).
- Aarts, E. and Lenstra, J. K. 1997. Local Search in Combinatorial Optimization. Wiley. Google Scholar
Digital Library
- Abello, J., Resende, M. G. C., and Sudarsky, S. 2002. Massive quasi-clique detection. In Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN ’02). Lecture Notes in Computer Science, vol. 2286. Springer, 598--612. Google Scholar
Digital Library
- Böckenhauer, H.-J., Hromkovič, J., Mömke, T., and Widmayer, P. 2008. On the hardness of reoptimization. In Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’08). Lecture Notes in Computer Science, vol. 4910. Springer, 50--65. Google Scholar
Digital Library
- Cai, L. 1996. Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58, 4, 171--176. Google Scholar
Digital Library
- Chen, J., Fomin, F. V., Liu, Y., Lu, S., and Villanger, Y. 2008a. Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74, 7, 1188--1198. Google Scholar
Digital Library
- Chen, J., Liu, Y., Lu, S., O’Sullivan, B., and Razgon, I. 2008b. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55, 5. Article 21. Google Scholar
Digital Library
- Dehne, F. K. H. A., Fellows, M. R., Langston, M. A., Rosamond, F. A., and Stevens, K. 2007. An O (2O(k)n
3) FPT algorithm for the undirected feedback vertex set problem. Theory Comput. Syst. 41, 3, 479--492. Google Scholar
Digital Library
- Gabow, H. N. and Tarjan, R. E. 1989. Faster scaling algorithms for network problems. SIAM J. Comput. 18, 5, 1013--1036. Google Scholar
Digital Library
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman. Google Scholar
Digital Library
- Greenwell, D. L., Hemminger, R. L., and Klerlein, J. B. 1973. Forbidden subgraphs. In Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing. 389--394.Google Scholar
- Guo, J. 2006. Algorithm design techniques for parameterized graph modification problems. Ph.D. thesis, Institut für Informatik, Friedrich-Schiller-Universität Jena.Google Scholar
- Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., and Wernicke, S. 2006. Compression-Based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72, 8, 1386--1396. Google Scholar
Digital Library
- Guo, J., Moser, H., and Niedermeier, R. 2009. Iterative compression for exactly solving NP-hard minimization problems. In Algorithmics of Large and Complex Networks. Lecture Notes in Computer Science, vol. 5515. Springer, 65--80. Google Scholar
Digital Library
- Hü
ffner, F., Komusiewicz, C., Moser, H., and Niedermeier, R. 2010. Fixed-Parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47, 1, 196--217. Google Scholar
Digital Library
- Khot, S. and Raman, V. 2002. Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289, 2, 997--1008. Google Scholar
Digital Library
- Krawczyk, A. 1999. The complexity of finding a second Hamiltonian cycle in cubic graphs. J. Comput. Syst. Sci. 58, 3, 641--647. Google Scholar
Digital Library
- Lewis, J. M. and Yannakakis, M. 1980. The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20, 2, 219--230.Google Scholar
Cross Ref
- Marx, D. 2010. Chordal deletion is fixed-parameter tractable. Algorithmica 57, 4, 747--768. Google Scholar
Digital Library
- Marx, D. and Schlotter, I. 2007. Obtaining a planar graph by vertex deletion. In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’07). Lecture Notes in Computer Science, vol. 4769. Springer, 292--303. Google Scholar
Digital Library
- Moser, H., Niedermeier, R., and Sorge, M. 2009. Algorithms and experiments for clique relaxations---Finding maximum s-plexes. In Proceedings of the 8th International Symposium on Experimental Algorithms (SEA’09). Lecture Notes in Computer Science, vol. 5526. Springer, 233--244. Google Scholar
Digital Library
- Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms. Oxford University Press.Google Scholar
- Nishimura, N., Ragde, P., and Thilikos, D. M. 2005. Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. Discr. Appl. Math. 152, 1--3, 229--245. Google Scholar
Digital Library
- Papadimitriou, C. H. 1994. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48, 3, 498--532. Google Scholar
Digital Library
- Razgon, I. and O’Sullivan, B. 2009. Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. 75, 8, 435--450. Google Scholar
Digital Library
- Reed, B., Smith, K., and Vetta, A. 2004. Finding odd cycle transversals. Oper. Res. Lett. 32, 4, 299--301. Google Scholar
Digital Library
Index Terms
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
Recommendations
Parameterized complexity of vertex deletion into perfect graph classes
Vertex deletion problems are at the heart of parameterized complexity. For a graph class F, the F-Deletion problem takes as input a graph G and an integer k. The question is whether it is possible to delete at most k vertices from G such that the ...
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
For two integers r, ℓ ź 0, a graph G = (V, E) is an (r, ℓ)-graph if V can be partitioned into r independent sets and ℓ cliques. In the parameterized (r, ℓ)-Vertex Deletion problem, given a graph G and an integer k, one has to decide whether at most k ...
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computationally unbounded but does not know any part of x; their goal is to ...






Comments