Subgraph Complementation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2020

Subgraph Complementation

Fedor V. Fomin
Petr A. Golovach
Torstein Strømme
  • Fonction : Auteur

Résumé

A \emph{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 $\mathcal{G}$, is there a subgraph complement of $G$ which is in $\mathcal{G}$? We show that this problem can be solved in polynomial time for various choices of the graphs class $\mathcal{G}$, such as bipartite, $d$-degenerate, or cographs. We complement these results by proving that the problem is \classNP-complete when $\mathcal{G}$ is the class of regular graphs.
Fichier principal
Vignette du fichier
Subgraph_Complementation.pdf (2.96 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03002656 , version 1 (20-11-2020)

Licence

Paternité

Identifiants

Citer

Fedor V. Fomin, Petr A. Golovach, Torstein Strømme, Dimitrios M. Thilikos. Subgraph Complementation. Algorithmica, 2020, 82 (7), pp.1859-1880. ⟨10.1007/s00453-020-00677-8⟩. ⟨hal-03002656⟩
56 Consultations
150 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More