Abstract
AbstractA subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class $${\mathscr {G}}$$G, is there a subgraph complement of G which is in $${\mathscr {G}}$$G? We show that this problem can be solved in polynomial time for various choices of the graphs class $${\mathscr {G}}$$G, such as bipartite, d-degenerate, or cographs. We complement these results by proving that the problem is $${{\mathrm{NP}}}$$NP-complete when $${\mathscr {G}}$$G is the class of regular graphs.
Funder
Norges Forskningsråd
Agence Nationale de la Recherche
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Blanché, A., Dabrowski, K.K., Johnson, M., Lozin, V.V., Paulusma, D., Zamaraev, V.: Clique-width for graph classes closed under complementation. In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, 21–25 Aug 2017, Aalborg, Denmark, Volume 83 of LIPIcs, pp. 73:1–73:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)
2. Bouchet, A.: Recognizing locally equivalent graphs. Discrete Math. 114(1–3), 75–86 (1993)
3. Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Volume 138 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (2012)
4. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)
5. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1–3), 77–114 (2000)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献