Exact algorithms for dominating clique problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Exact algorithms for dominating clique problems

Résumé

We handle in this paper three dominating clique problems, namely, the decision problem itself when one asks if there exists a dominating clique in a graph G and two optimization versions where one asks for a maximum- and a minimum-size dominating clique, if any. For the three problems we propose optimal algorithms with provably worst-case upper bounds improving existing ones by (D. Kratsch and M. Liedloff, An exact algorithm for the minimum dominating clique problem, The- oretical Computer Science 385(1-3), pp. 226-240, 2007). We then settle all the three problems in sparse and dense graphs also providing improved upper running time bounds.
Fichier principal
Vignette du fichier
cahier_285.pdf (293.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00877043 , version 1 (25-10-2013)

Identifiants

  • HAL Id : hal-00877043 , version 1

Citer

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Exact algorithms for dominating clique problems. 2009. ⟨hal-00877043⟩
115 Consultations
102 Téléchargements

Partager

Gmail Facebook X LinkedIn More