An Exact Algorithm for the Minimum Dominating Clique Problem

DOI10.1007/11847250_12MaRDI QIDQ3499731zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An exact algorithm for the minimum dominating clique problem
• Exact algorithms for dominating clique problems (extended abstract)
• An exact algorithm for the maximum clique problem
• Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
• Algorithms for dominating clique problems
• Exact algorithms for maximum clique: a computational study
• scientific article; zbMATH DE number 4045183
• Algorithms for Minimum m-Connected k-Dominating Set Problem
• Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
• An exact algorithm for the maximum quasi‐clique problem

Cited in

(7)

• Exact algorithms for the minimum cost vertex blocker clique problem
• Clique domination in graphs.
• scientific article; zbMATH DE number 4045183 (Why is no real title available?)
• Exact algorithms for dominating clique problems (extended abstract)
• Finding minimum clique capacity
• Algorithms for dominating clique problems
• An exact algorithm for the minimum dominating clique problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499731)