Exact algorithms for dominating clique problems (extended abstract)

DOI10.1007/978-3-642-10631-6_3MaRDI QIDQ3652186zbMATH OpenOpenAlexFDO

Authors Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, F. Della Croce

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_3

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for dominating clique problems
• An exact algorithm for the minimum dominating clique problem
• An Exact Algorithm for the Minimum Dominating Clique Problem
• Graph-Theoretic Concepts in Computer Science
• Dominating cliques in graphs

Cited in

(11)

• Exact algorithms for the minimum cost vertex blocker clique problem
• Algorithms for dominating clique problems
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• On identifying dominant cliques.
• Fast exact algorithms for some connectivity problems parameterized by clique-width
• An exact algorithm for the minimum dominating clique problem
• An Exact Algorithm for the Minimum Dominating Clique Problem
• An exact exponential time algorithm for counting bipartite cliques
• Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
• On the complexity of fixed parameter clique and dominating set
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

This page was built for publication: Exact algorithms for dominating clique problems (extended abstract)

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