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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6201597 / rank
 
Normal rank
Property / zbMATH Keywords
 
Russian doll search
Property / zbMATH Keywords: Russian doll search / rank
 
Normal rank
Property / zbMATH Keywords
 
clique relaxations
Property / zbMATH Keywords: clique relaxations / rank
 
Normal rank
Property / zbMATH Keywords
 
\(s\)-plex
Property / zbMATH Keywords: \(s\)-plex / rank
 
Normal rank
Property / zbMATH Keywords
 
\(s\)-defective clique
Property / zbMATH Keywords: \(s\)-defective clique / rank
 
Normal rank

Revision as of 11:27, 28 June 2023

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