Algorithms for dominating clique problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2012

Algorithms for dominating clique problems

Résumé

We handle in this paper three dominating clique problems, namely, the decision problem to detect whether a graph has a dominating clique and two optimization versions asking to compute a maximum- and a minimum-size dominating clique of a graph G, if G has a dominating clique. For the three problems we propose exact moderately exponential algorithms with worst-case running time upper bounds improving those by Kratsch and Liedloff [D. Kratsch, M. Liedloff, An exact algorithm for the minimum dominating clique problem, Theoret. Comput. Sci. 385 (1–3) (2007) 226–240]. We then study the three problems in sparse and dense graphs also providing improved running time upper bounds. Finally, we propose some exponential time approximation algorithms for the optimization versions.

Dates et versions

hal-01509536 , version 1 (18-04-2017)

Identifiants

Citer

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Algorithms for dominating clique problems. Theoretical Computer Science, 2012, 459 (9), ⟨10.1016/j.tcs.2012.07.016⟩. ⟨hal-01509536⟩
20 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More