Exact Algorithms for Dominating Clique Problems

DOI10.1007/978-3-642-10631-6_3zbMath1272.68330OpenAlexW2118810957MaRDI QIDQ3652186

Vangelis Th. Paschos, Nicolas Bourgeois, Bruno Escoffier, Frederico 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

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)

Related Items (1)

Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation

This page was built for publication: Exact Algorithms for Dominating Clique Problems