Algorithms for dominating clique problems (Q1758169)

From MaRDI portal
Revision as of 09:16, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Algorithms for dominating clique problems
scientific article

    Statements

    title
    Algorithms for dominating clique problems (English)
    0 references
    author
    Bruno Escoffier
    0 references
    Vangelis Th. Paschos
    0 references
    publication date
    8 November 2012
    0 references
    zbMATH Keywords
    dominating clique
    0 references
    exponential time algorithms
    0 references
    exact and approximation algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C85
    0 references
    68W40
    0 references
    68W25
    0 references
    zbMATH DE Number
    6103624
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1758169&oldid=21138700"
    Powered by MediaWiki