Document Open Access Logo

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs

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



PDF
Thumbnail PDF

File

LIPIcs.SWAT.2016.14.pdf
  • Filesize: 459 kB
  • 14 pages

Document Identifiers

Author Details

Iyad Kanj
Christian Komusiewicz
Manuel Sorge
Erik Jan van Leeuwen

Cite AsGet BibTex

Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen. Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 14:1-14:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.SWAT.2016.14

Abstract

We consider the recognition problem for two graph classes that generalize split and unipolar graphs, respectively. First, we consider the recognizability of graphs that admit a monopolar partition: a partition of the vertex set into sets A,B such that G[A] is a disjoint union of cliques and G[B] an independent set. If in such a partition G[A] is a single clique, then G is a split graph. We show that in O(2^k * k^3 * (|V(G)| + |E(G)|)) time we can decide whether G admits a monopolar partition (A,B) where G[A] has at most k cliques. This generalizes the linear-time algorithm for recognizing split graphs corresponding to the case when k=1. Second, we consider the recognizability of graphs that admit a 2-subcoloring: a partition of the vertex set into sets A,B such that each of G[A] and G[B] is a disjoint union of cliques. If in such a partition G[A] is a single clique, then G is a unipolar graph. We show that in O(k^(2k+2) * (|V(G)|^2+|V(G)| * |E(G)|)) time we can decide whether G admits a 2-subcoloring (A,B) where G[A] has at most k cliques. This generalizes the polynomial-time algorithm for recognizing unipolar graphs corresponding to the case when k=1. We also show that in O(4^k) time we can decide whether G admits a 2-subcoloring (A,B) where G[A] and G[B] have at most k cliques in total. To obtain the first two results above, we formalize a technique, which we dub inductive recognition, that can be viewed as an adaptation of iterative compression to recognition problems. We believe that the formalization of this technique will prove useful in general for designing parameterized algorithms for recognition problems. Finally, we show that, unless the Exponential Time Hypothesis fails, no subexponential-time algorithms for the above recognition problems exist, and that, unless P=NP, no generic fixed-parameter algorithm exists for the recognizability of graphs whose vertex set can be bipartitioned such that one part is a disjoint union of k cliques.
Keywords
  • vertex-partition problems
  • monopolar graphs
  • subcolorings
  • split graphs
  • unipolar graphs
  • fixed-parameter algorithms

Metrics

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

References

  1. Demetrios Achlioptas. The complexity of G-free colourability. Discrete Mathematics, 165–166(0):21-30, 1997. Google Scholar
  2. Hajo Broersma, Fedor V. Fomin, Jaroslav Nešetřil, and Gerhard J. Woeginger. More about subcolorings. Computing, 69(3):187-203, 2002. Google Scholar
  3. Sharon Bruckner, Falk Hüffner, and Christian Komusiewicz. A graph modification approach for finding core-periphery structures in protein interaction networks. Algorithms for Molecular Biology, 10:16, 2015. Google Scholar
  4. Ross Churchley and Jing Huang. List monopolar partitions of claw-free graphs. Discrete Mathematics, 312(17):2545-2549, 2012. Google Scholar
  5. Ross Churchley and Jing Huang. Solving partition problems with colour-bipartitions. Graphs and Combinatorics, 30(2):353-364, 2014. Google Scholar
  6. 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
  7. Reinhard Diestel. Graph Theory, 4th Edition. Springer, 2012. Google Scholar
  8. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin, Heidelberg, 2013. Google Scholar
  9. Tınaz Ekim, Pavol Hell, Juraj Stacho, and Dominique de Werra. Polarity of chordal graphs. Discrete Applied Mathematics, 156(13):2469-2479, 2008. Google Scholar
  10. E. M. Eschen and X. Wang. Algorithms for unipolar and generalized split graphs. Discrete Applied Mathematics, 162:195-201, 2014. Google Scholar
  11. Alastair Farrugia. Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. The Electronic Journal of Combinatorics, 11(1):R46, 2004. Google Scholar
  12. Jirí Fiala, Klaus Jansen, Van Bang Le, and Eike Seidel. Graph subcolorings: Complexity and algorithms. SIAM Journal on Discrete Mathematics, 16(4):635-650, 2003. Google Scholar
  13. Peter L. Hammer and Bruno Simeone. The splittance of a graph. Combinatorica, 1(3):275-284, 1981. Google Scholar
  14. Sudeshna Kolay and Fahad Panolan. Parameterized Algorithms for Deletion to (r,𝓁)-Graphs. In Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 45 of LIPIcs, pages 420-433. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  15. Van Bang Le and Ragnar Nevries. Complexity and algorithms for recognizing polar and monopolar graphs. Theoretical Computer Science, 528:1-11, 2014. Google Scholar
  16. Colin McDiarmid and Nikola Yolov. Recognition of unipolar and generalised split graphs. Algorithms, 8(1):46-59, 2015. Google Scholar
  17. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994. Google Scholar
  18. Bruce A. Reed, Kaleigh Smith, and Adrian Vetta. Finding odd cycle transversals. Opererations Research Letters, 32(4):299-301, 2004. Google Scholar
  19. Juraj Stacho. On 2-subcolourings of chordal graphs. In Proceedings of the 8th Latin American Theoretical Informatics Symposium, volume 4957 of LNCS, pages 544-554. Springer, 2008. Google Scholar
  20. Regina I. Tyshkevich and Arkady A. Chernyak. Algorithms for the canonical decomposition of a graph and recognizing polarity. Izvestia Akad. Nauk BSSR, ser. Fiz. Mat. Nauk, 6:16-23, 1985. In Russian. Google Scholar
  21. Regina I. Tyshkevich and Arkady A. Chernyak. Decomposition of graphs. Cybernetics and Systems Analysis, 21(2):231-242, 1985. 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