On the number of minimal dominating sets on some graph classes (Q476916): 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: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6376007 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
exponential-time algorithms
Property / zbMATH Keywords: exponential-time algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
graph classes
Property / zbMATH Keywords: graph classes / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating sets
Property / zbMATH Keywords: dominating sets / rank
 
Normal rank
Property / zbMATH Keywords
 
enumerating algorithms
Property / zbMATH Keywords: enumerating algorithms / rank
 
Normal rank

Revision as of 19:12, 30 June 2023

scientific article
Language Label Description Also known as
English
On the number of minimal dominating sets on some graph classes
scientific article

    Statements

    On the number of minimal dominating sets on some graph classes (English)
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    graph algorithms
    0 references
    exponential-time algorithms
    0 references
    graph classes
    0 references
    dominating sets
    0 references
    enumerating algorithms
    0 references

    Identifiers