Document Open Access Logo

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Authors Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen

PDF
Thumbnail PDF

File

LIPIcs.ESA.2018.51.pdf
  • Filesize: 0.69 MB
  • 14 pages

Document Identifiers

Author Details

Iyad Kanj
  • School of Computing, DePaul University Chicago, USA
Christian Komusiewicz
  • Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Germany
Manuel Sorge
  • Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer Sheva, Israel
Erik Jan van Leeuwen
  • Department of Information and Computing Sciences, Utrecht University, The Netherlands

Funding

  • Komusiewicz, Christian: CK gratefully acknowledges support by the DFG, project MAGZ, KO 3669/4-1.
  • Sorge, Manuel: MS gratefully acknowledges support by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement number 631163.11, by the Israel Science Foundation (grant number 551145/14), and by the European Research Council (ERC) underthe European Union’s Horizon 2020 research and innovation programme under grant agreement number 714704.

Cite AsGet BibTex

Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ESA.2018.51

Abstract

A fundamental graph problem is to recognize whether the vertex set of a graph G can be bipartitioned into sets A and B such that G[A] and G[B] satisfy properties Pi_A and Pi_B, respectively. This so-called (Pi_A,Pi_B)-Recognition problem generalizes amongst others the recognition of 3-colorable, bipartite, split, and monopolar graphs. A powerful algorithmic technique that can be used to obtain fixed-parameter algorithms for many cases of (Pi_A,Pi_B)-Recognition, as well as several other problems, is the pushing process. For bipartition problems, the process starts with an "almost correct" bipartition (A',B'), and pushes appropriate vertices from A' to B' and vice versa to eventually arrive at a correct bipartition. In this paper, we study whether (Pi_A,Pi_B)-Recognition problems for which the pushing process yields fixed-parameter algorithms also admit polynomial problem kernels. In our study, we focus on the first level above triviality, where Pi_A is the set of P_3-free graphs (disjoint unions of cliques, or cluster graphs), the parameter is the number of clusters in the cluster graph G[A], and Pi_B is characterized by a set H of connected forbidden induced subgraphs. We prove that, under the assumption that NP not subseteq coNP/poly, (Pi_A,Pi_B)-Recognition admits a polynomial kernel if and only if H contains a graph of order at most 2. In both the kernelization and the lower bound results, we make crucial use of the pushing process.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
  • Theory of computation → Algorithm design techniques
Keywords
  • Fixed-parameter algorithms
  • Kernelization
  • Vertex-partition problems
  • Reduction rules
  • Cross-composition

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Faisal N. Abu-Khzam, Carl Feghali, and Haiko Müller. Partitioning a graph into disjoint cliques and a triangle-free graph. Discrete Appl. Math., 190-191:1-12, 2015. Google Scholar
  2. Demetrios Achlioptas. The complexity of G-free colourability. Discrete Math., 165–166(0):21-30, 1997. Google Scholar
  3. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Kernelization lower bounds by cross-composition. SIAM J. Discrete Math., 28(1):277-305, 2014. Google Scholar
  4. Marin Bougeret and Pascal Ochem. The complexity of partitioning into disjoint cliques and a triangle-free graph. Discrete Appl. Math., 217:438-445, 2017. Google Scholar
  5. Hajo Broersma, Fedor V. Fomin, Jaroslav Nešetřil, and Gerhard J. Woeginger. More about subcolorings. Computing, 69(3):187-203, 2002. Google Scholar
  6. Sharon Bruckner, Falk Hüffner, and Christian Komusiewicz. A graph modification approach for finding core-periphery structures in protein interaction networks. Algorithms Mol. Biol., 10:16, 2015. Google Scholar
  7. Zh. A. Chernyak and A. A. Chernyak. About recognizing (α, β) classes of polar graphs. Discrete Math., 62(2):133-138, 1986. Google Scholar
  8. Ross Churchley and Jing Huang. On the polarity and monopolarity of graphs. J. Graph Theory, 76(2):138-148, 2014. Google Scholar
  9. Ross Churchley and Jing Huang. Solving partition problems with colour-bipartitions. Graph. Combinator., 30(2):353-364, 2014. Google Scholar
  10. Marek Cygan, Fedor V Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  11. Reinhard Diestel. Graph Theory, 4th Edition. Springer, 2012. Google Scholar
  12. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin, Heidelberg, 2013. Google Scholar
  13. Alastair Farrugia. Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron. J. Comb., 11(1):R46, 2004. Google Scholar
  14. Michael R. Fellows, Danny Hermelin, Frances Rosamond, and Stéphane Vialette. On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci., 410(1):53-61, 2009. Google Scholar
  15. Jirí Fiala, Klaus Jansen, Van Bang Le, and Eike Seidel. Graph subcolorings: Complexity and algorithms. SIAM J. Discrete Math., 16(4):635-650, 2003. Google Scholar
  16. Stéphane Foldes and Peter L. Hammer. Split graphs. Congr. Numer., 19:311-315, 1977. Google Scholar
  17. Lance Fortnow and Rahul Santhanam. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci., 77(1):91-106, 2011. Google Scholar
  18. John Gimbel and Chris Hartman. Subcolorings and the subchromatic number of a graph. Discrete Math., 272:139-154, 2003. Google Scholar
  19. Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Infor. Comput., 231:109-116, 2013. Google Scholar
  20. Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen. Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci., 92:22-47, 2018. Google Scholar
  21. Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, and Saket Saurabh. Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs. In Proc. 41st MFCS, volume 58 of LIPIcs, pages 75:1-75:13. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2016. Google Scholar
  22. Jan Kratochvíl and Ingo Schiermeyer. On the computational complexity of (𝒪, 𝒫)-partition problems. Discuss. Math. Graph Theory, 17(2):253-258, 1997. Google Scholar
  23. Van Bang Le and Ragnar Nevries. Complexity and algorithms for recognizing polar and monopolar graphs. Theor. Comput. Sci., 528:1-11, 2014. Google Scholar
  24. Juraj Stacho. On 2-subcolourings of chordal graphs. In Proc. 8th LATIN, volume 4957 of LNCS, pages 544-554. Springer, 2008. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact