An Exact Algorithm for the Minimum Dominating Clique Problem

DOI10.1007/11847250_12zbMath1154.68453OpenAlexW2124046904MaRDI QIDQ3499731

Dieter Kratsch, Mathieu Liedloff

Publication date: 3 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11847250_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: An Exact Algorithm for the Minimum Dominating Clique Problem