Dáaniel Marx
Skip Abstract Section
Abstract
We present a method for reducing the treewidth of a graph while preserving all of its minimal s-t separators up to a certain fixed size k. This technique allows us to solve s-t Cut and Multicut problems with various additional restrictions (e.g., the vertices being removed from the graph form an independent set or induce a connected graph) in linear time for every fixed number k of removed vertices.
Our results have applications for problems that are not directly defined by separators, but the known solution methods depend on some variant of separation. For example, we can solve similarly restricted generalizations of Bipartization (delete at most k vertices from G to make it bipartite) in almost linear time for every fixed number k of removed vertices. These results answer a number of open questions in the area of parameterized complexity. Furthermore, our technique turns out to be relevant for (H, C, K)- and (H, C,≤K)-coloring problems as well, which are cardinality constrained variants of the classical H-coloring problem. We make progress in the classification of the parameterized complexity of these problems by identifying new cases that can be solved in almost linear time for every fixed cardinality bound.
- Bansal, N., Blum, A., and Chawla, S. 2004. Correlation clustering. Mach. Learn. 56, 1--3, 89--113. Google Scholar
Digital Library
- Belmonte, R., Golovach, P. A., Heggernes, P., van't Hof, P., Kaminski, M., and Paulusma, D. 2011a. Finding contractions and induced minors in chordal graphs via disjoint paths. In Proceedings of ISAAC. 110--119. Google ScholarDigital Library
- Belmonte, R., Heggernes, P., and van't Hof, P. 2011b. Edge contractions in subclasses of chordal graphs. In Proceedings of TAMC. 528--539. Google ScholarDigital Library
- Björklund, A., Husfeldt, T., Kaski, P., and Koivisto, M. 2007. Fourier meets Möbius: fast subset convolution. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC'07). ACM, New York, 67--74. Google ScholarDigital Library
- Bodlaender, H. L. 2006. Treewidth: Characterizations, applications, and computations. In Proceedings of WG. 1--14. Google ScholarDigital Library
- Bodlaender, H. L., Fellows, M. R., Heggernes, P., Mancini, F., Papadopoulos, C., and Rosamond, F. A. 2010. Clustering with partial information. Theor. Comput. Sci. 411, 7--9, 1202--1211. Google ScholarDigital Library
- Bousquet, N., Daligault, J., and Thomassé, S. 2011. Multicut is FPT. In Proceedings of STOC. 459--468. Google ScholarDigital Library
- Brewster, R. C., Hell, P., and MacGillivray, G. 1997. The complexity of restricted graph homomorphisms. Disc. Math. 167--168, 145--154. Google ScholarDigital Library
- Cai, L. 1996. Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Proc. Lett. 58, 4, 171--176. Google ScholarDigital Library
- Chandran, L. S. and Kavitha, T. 2006. The treewidth and pathwidth of hypercubes. Disc. Math. 306, 3, 359--365.Google ScholarDigital Library
- Chen, J., Liu, Y., and Lu, S. 2007. An improved parameterized algorithm for the minimum node multiway cut problem. In Proceedings of WADS. 495--506. Google ScholarDigital Library
- Chen, J., Liu, Y., Lu, S., O'Sullivan, B., and Razgon, I. 2008. A fixed-parameter algorithm for the Directed Feedback Vertex Set problem. J. ACM 55, 5. Google ScholarDigital Library
- Courcelle, B. 1990. Graph rewriting: an algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 193--242. Google ScholarDigital Library
- Cygan, M., Pilipczuk, M., Pilipczuk, M., and Wojtaszczyk, J. O. 2011. On multiway cut parameterized above lower bounds. In Proceedings of IPEC. 1--12. Google ScholarDigital Library
- Demaine, E., Gutin, G. Z., Marx, D., and Stege, U. 2007. Seminar 07281 open problems. In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Dagstuhl Seminar Proceedings.Google Scholar
- Demaine, E. D., Emanuel, D., Fiat, A., and Immorlica, N. 2006. Correlation clustering in general weighted graphs. Theoret. Comput. Sci. 361, 2--3, 172--187. Google ScholarDigital Library
- Díaz, J., Serna, M., and Thilikos, D. M. 2001. (H, C, K)-coloring: Fast, easy, and hard cases. In Mathematical Foundations of Computer Science (Mariánské Láznĕ), Lecture Notes in Computer Science Series, vol. 2136, Springer, Berlin, 304--315. Google ScholarDigital Library
- Díaz, J., Serna, M. J., and Thilikos, D. M. 2005. The restrictive H-coloring problem. Disc. Appl. Math. 145, 2, 297--305. Google ScholarDigital Library
- Díaz, J., Serna, M. J., and Thilikos, D. M. 2007. Complexity issues on bounded restrictive H-coloring. Disc. Math. 307, 16, 2082--2093.Google ScholarDigital Library
- Díaz, J., Serna, M. J., and Thilikos, D. M. 2008. Efficient algorithms for counting parameterized list H-colorings. J. Comput. Syst. Sci. 74, 5, 919--937. Google ScholarDigital Library
- Downey, R. G. and Fellows, M. R. 1999. Parameterized Complexity. Monographs in Computer Science, Springer, New York. Google ScholarDigital Library
- Dreyfus, S. E. and Wagner, R. A. 1971/72. The Steiner problem in graphs. Networks 1, 195--207.Google ScholarCross Ref
- Feder, T., Hell, P., and Huang, J. 1999. List homomorphisms and circular arc graphs. Combinatorica 19, 4, 487--505.Google ScholarCross Ref
- Feder, T., Hell, P., and Mohar, B. 2003. Acyclic homomorphisms and circular colorings of digraphs. SIAM J. Discrete Math. 17, 1, 161--169. Google ScholarDigital Library
- Feige, U. and Mahdian, M. 2006. Finding small balanced separators. In Proceedings of STOC 2006. ACM, 375--384. Google ScholarDigital Library
- Flum, J. and Grohe, M. 2006. Parameterized Complexity Theory. Springer. Google ScholarDigital Library
- Galluccio, A., Hell, P., and Nesetril, J. 2000. The complexity of H-colouring of bounded degree graphs. Disc. Math. 222, 1--3, 101--109. Google ScholarDigital Library
- Golovach, P., Kaminski, M., Paulusma, D., and Thilikos, D. 2011. Increasing the minimum degree of a graph by contractions. In Proceedings of IPEC. 67--79. Google ScholarDigital Library
- Gottlob, G. and Lee, S. T. 2007. A logical approach to multicut problems. Inf. Proc. Lett. 103, 4, 136--141. Google ScholarDigital Library
- Grohe, M. 2007. Logic, graphs, and algorithms. In Logic and Automata- History and Perspectives, J. Flum, E. Grädel, and T. Wilke, Eds., Amsterdam University Press.Google Scholar
- Guillemot, S. 2011. FPT algorithms for path-transversal and cycle-transversal problems. Disc. Optim. 8, 1, 61--71. Google ScholarDigital Library
- 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. System Sci. 72, 8, 1386--1396. Google ScholarDigital Library
- Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., and Uhlmann, J. 2008. Complexity and exact algorithms for Vertex Multicut in interval and bounded treewidth graphs. Euro. J. Oper. Res. 186, 2, 542--553.Google ScholarCross Ref
- Gupta, A., Hell, P., Karimi, M., and Rafiey, A. 2008. Minimum cost homomorphisms to reflexive digraphs. In Proceedings of LATIN. 182--193. Google ScholarDigital Library
- Gutin, G., Hell, P., Rafiey, A., and Yeo, A. 2006. Minimum cost homomorphisms to proper interval graphs and bigraphs. CoRR abs/cs/0602038.Google Scholar
- Gutin, G., Hell, P., Rafiey, A., and Yeo, A. 2008. A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29, 4, 900--911. Google ScholarDigital Library
- Heggernes, P., van't Hof, P., Lévêque, B., Lokshtanov, D., and Paul, C. 2011a. Contracting graphs to paths and trees. In Proceedings of IPEC. 55--66. Google ScholarDigital Library
- Heggernes, P., van't Hof, P., Lévêque, B., and Paul, C. 2011b. Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Disc. Math. 37, 87--92.Google ScholarCross Ref
- Heggernes, P., van't Hof, P., Lokshtanov, D., and Paul, C. 2011c. Obtaining a bipartite graph by contracting few edges. In Proceedings of FSTTCS. 217--228.Google Scholar
- Hell, P. 2006. From graph colouring to constraint satisfaction: there and back again. In Topics in Discrete Mathematics, Algorithms Combin. Series, vol. 26, Springer, Berlin, 407--432.Google Scholar
- Hell, P. and Nešetřil, J. 1990. On the complexity of H-coloring. J. Combin. Theory Ser. B 48, 1, 92--110. Google ScholarDigital 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 ScholarDigital Library
- Kaminski, M., Paulusma, D., and Thilikos, D. M. 2010. Contractions of planar graphs in polynomial time. In Proceedings of ESA. 122--133. Google ScholarDigital Library
- Kanj, I. 2008. Open problem session of Dagstuhl seminar 08431.Google Scholar
- Kawarabayashi, K. and Reed, B. 2010. An (almost) linear time algorithm for odd cyles transversal. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10). 365--378. Google ScholarDigital Library
- Krishnamoorthy, M. S. and Deo, N. 1979. Node-deletion NP-complete problems. SIAM J. Comput. 8, 4, 619--625.Google ScholarDigital Library
- Lewis, J. M. and Yannakakis, M. 1980. The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci. 20, 2, 219--230.Google ScholarCross Ref
- Lokshtanov, D. 2008. Wheel-free deletion is W{2}-hard. In Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC'08). Lecture Notes in Computer Science Series, vol. 5018, Springer, 141--147. Google ScholarDigital Library
- Lokshtanov, D. and Nederlof, J. 2010. Saving space by algebraization. In Proceedings of STOC. 321--330. Google ScholarDigital Library
- Lokshtanov, D., Saurabh, S., and Sikdar, S. 2009. Simpler parameterized algorithm for oct. In Proceedings of IWOCA. 380--384. Google ScholarDigital Library
- Marx, D. 2006. Parameterized graph separation problems. Theoret. Comput. Sci. 351, 3, 394--406. Google ScholarDigital Library
- Marx, D. 2010. Chordal deletion is fixed-parameter tractable. Algorithmica 57, 4, 747--768. Google ScholarDigital Library
- Marx, D., O'Sullivan, B., and Razgon, I. 2010. Treewidth reduction for constrained separation and bipartization problems. In Proceedings of STACS. 561--572.Google Scholar
- Marx, D. and Razgon, I. 2009. Constant ratio fixed-parameter approximation of the Edge Multicut problem. Inf. Proc. Lett. 109, 20, 1161--1166. Google ScholarDigital Library
- Marx, D. and Razgon, I. 2011. Fixed-parameter tractability of Multicut parameterized by the size of the cutset. In Proceedings of STOC. 469--478. Google ScholarDigital Library
- Nederlof, J. 2009. Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner Tree and related problems. In Proceedings of ICALP. 713--725. Google ScholarDigital Library
- Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and cits Applications Series, vol. 31, Oxford University Press, Oxford, UK.Google Scholar
- Picard, J.-C. and Queyranne, M. 1980. On the structure of all minimum cuts in a network and applications. Math. Programming Stud. 13, 8--16.Google ScholarCross Ref
- Razgon, I. and O'Sullivan, B. 2009. Almost 2-sat is fixed-parameter tractable. J. Comput. Syst. Sci. 75, 8, 435--450. Google ScholarDigital Library
- Reed, B. 1997. Tree width and tangles: A new connectivity measure and some applications. In Surveys in Combinatorics, R. Bailey, Ed., LMS Lecture Note Series, vol. 241, Cambridge University Press, 87--162.Google Scholar
- Reed, B., Smith, K., and Vetta, A. 2004. Finding odd cycle transversals. Oper. Res. Lett. 32, 4, 299--301. Google ScholarDigital Library
- Samer, M. and Szeider, S. 2006. Complexity and applications of edge-induced vertex-cuts. CoRR abs/cs/0607109.Google Scholar
- Seymour, P. D. and Thomas, R. 1993. Graph searching and a min-max theorem for tree-width. J. Combinat. Theory, Ser. B 58, 1, 22--33. Google ScholarDigital Library
- Sloper, C. and Telle, J. A. 2008. An overview of techniques for designing parameterized algorithms. Comput. J. 51, 1, 122--136. Google ScholarDigital Library
- van't Hof, P., Kaminski, M., Paulusma, D., Szeider, S., and Thilikos, D. M. 2010. On contracting graphs to fixed pattern graphs. In Proceedings of SOFSEM. 503--514. Google ScholarDigital Library
- Xiao, M. 2010. Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst. 46, 4, 723--736. Google ScholarDigital Library
- Yannakakis, M. 1981. Edge-deletion problems. SIAM J. Comput. 10, 2, 297--309.Google ScholarDigital Library
Index Terms
- Finding small separators in linear time via treewidth reduction
Recommendations
Hitting forbidden subgraphs in graphs of bounded treewidth
We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph H and an input graph G, the task is to find a set XV(G) of minimum size that hits all subgraphs of G isomorphic to H. In the colorful variant of ...
A tight lower bound for Vertex Planarization on graphs of bounded treewidth
In the Vertex Planarization problem one asks to delete the minimum possible number of vertices from an input graph to obtain a planar graph. The parameterized complexity of this problem, parameterized by the solution size (the number of deleted vertices)...
Safe separators for treewidth
A set of vertices S@?V is called a safe separator for treewidth, if S is a separator of G, and the treewidth of G equals the maximum of the treewidth over all connected components W of G-S of the graph, obtained by making S a clique in the subgraph of G,...
Comments