Liar's domination in graphs: complexity and algorithm (Q1949115): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithms for domination problems in sun-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algorithmic Complexity of Total Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspect of \(k\)-tuple domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3616664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liar's domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liar's domination / rank
 
Normal rank

Latest revision as of 09:14, 6 July 2024

scientific article
Language Label Description Also known as
English
Liar's domination in graphs: complexity and algorithm
scientific article

    Statements

    Liar's domination in graphs: complexity and algorithm (English)
    0 references
    0 references
    0 references
    25 April 2013
    0 references
    graph algorithm
    0 references
    NP-completeness
    0 references
    domination
    0 references
    Liar's domination
    0 references

    Identifiers