Abstract
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, Theoretical 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. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bourgeois, N., Della Croce, F., Escoffier, B., & Paschos, V. T. (2009). Exact algorithms for dominating clique problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 4–13). Springer Verlag. https://doi.org/10.1007/978-3-642-10631-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
