Enumerating Minimal Dominating Sets in Triangle-Free Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Enumerating Minimal Dominating Sets in Triangle-Free Graphs

Résumé

It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we prove that this is the case in triangle-free graphs. This answers a question of Kanté et al. Additionally, we show that deciding if a set of vertices of a bipartite graph can be completed into a minimal dominating set is a NP-complete problem.
Fichier principal
Vignette du fichier
LIPIcs-STACS-2019-16.pdf (532.06 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02181721 , version 1 (12-07-2019)

Licence

Paternité

Identifiants

Citer

Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond. Enumerating Minimal Dominating Sets in Triangle-Free Graphs. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩. ⟨hal-02181721⟩
133 Consultations
266 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More