Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375)

From MaRDI portal
Revision as of 19:44, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
scientific article

    Statements

    Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (English)
    0 references
    26 August 2013
    0 references
    0 references
    Russian doll search
    0 references
    clique relaxations
    0 references
    \(s\)-plex
    0 references
    \(s\)-defective clique
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references