Generalized perfect domination in graphs (Q2444147): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on perfect k-domination in trees: An algorithmic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted perfect domination problem and its variants / rank
 
Normal rank

Latest revision as of 14:51, 7 July 2024

scientific article
Language Label Description Also known as
English
Generalized perfect domination in graphs
scientific article

    Statements

    Generalized perfect domination in graphs (English)
    0 references
    0 references
    0 references
    8 April 2014
    0 references
    \(k\)-domination
    0 references
    perfect \(k\)-domination
    0 references
    NP-completeness
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers