NP-completeness and APX-completeness of restrained domination in graphs (Q442103): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and approximation algorithms for (weighted) paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in claw-free graphs with minimum degree at least two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3094567 / 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: Graphs with large restrained domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination numbers of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on restrained domination and total restrained domination in graphs / rank
 
Normal rank

Latest revision as of 12:41, 5 July 2024

scientific article
Language Label Description Also known as
English
NP-completeness and APX-completeness of restrained domination in graphs
scientific article

    Statements

    NP-completeness and APX-completeness of restrained domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2012
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    approximation ratio
    0 references
    domination problems
    0 references
    restrained domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers