On approximating the minimum independent dominating set (Q750159): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3206969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank

Revision as of 12:30, 21 June 2024

scientific article
Language Label Description Also known as
English
On approximating the minimum independent dominating set
scientific article

    Statements

    On approximating the minimum independent dominating set (English)
    0 references
    0 references
    1991
    0 references
    computational complexity
    0 references
    combinatorial problems
    0 references
    NP-hard graph problems
    0 references
    polynomial-time approximation algorithm
    0 references

    Identifiers