Algorithmic aspects of 2-secure domination in graphs (Q2045038): 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: The algorithmic use of hypertree structure and maximum neighbourhood orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / 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: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of semitotal domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of secure connected domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Some Variants of Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Hardness Results on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity issues of variants of secure domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly chordal graphs, steiner trees, and connected domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Revision as of 09:01, 26 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic aspects of 2-secure domination in graphs
scientific article

    Statements

    Algorithmic aspects of 2-secure domination in graphs (English)
    0 references
    11 August 2021
    0 references
    2-secure domination
    0 references
    W[2]-hard
    0 references
    planar graphs
    0 references
    APX-complete
    0 references
    star convex bipartite graphs
    0 references
    inapproximability
    0 references

    Identifiers