Algorithms for dominating clique problems
type: Item
instance of: scholarly article
title: Algorithms for dominating clique problems
zbMATH Open document ID: 1252.05160
author: Bruno Escoffier
author: Vangelis Th. Paschos
author: Nicolas Bourgeois
author: F. Della Croce
published in: Theoretical Computer Science
publication date: 2012-11-08T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6103624
zbMATH Keywords: dominating clique
zbMATH Keywords: exponential time algorithms
zbMATH Keywords: exact and approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.07.016
OpenAlex ID: W2048060811
cites work: Set Partitioning via Inclusion-Exclusion
cites work: Approximation of min coloring by moderately exponential algorithms
cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms
cites work: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
cites work: Fast algorithms for max independent set
cites work: Enumerating maximal independent sets with applications to graph colouring.
cites work: Clustering and domination in perfect graphs
cites work: Dominating cliques in graphs
cites work: Exponential-time approximation of weighted set cover
cites work: Exact and approximate bandwidth
cites work: A measure & conquer approach for the analysis of exact algorithms
cites work: An Exponential Time 2-Approximation Algorithm for Bandwidth
cites work: Q4198056
cites work: Which problems have strongly exponential complexity?
cites work: On generating all maximal independent sets
cites work: Dominating sets in social network graphs
cites work: Q4378629
cites work: An exact algorithm for the minimum dominating clique problem
cites work: On cliques in graphs
cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques
cites work: Algorithms for maximum independent sets
DOI: 10.1016/J.TCS.2012.07.016
description: scientific article; zbMATH DE number 6103624