Algorithms for dominating clique problems (Q1758169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min coloring by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential-time approximation of weighted set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Time 2-Approximation Algorithm for Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in social network graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the minimum dominating clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank

Latest revision as of 21:09, 5 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for dominating clique problems
scientific article

    Statements

    Algorithms for dominating clique problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dominating clique
    0 references
    exponential time algorithms
    0 references
    exact and approximation algorithms
    0 references
    0 references