On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.01.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994364012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized domination and efficient domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect elimination orderings of chordal powers of 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: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer domination in graphs and Vizing-like problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple domination and limited packing problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Total {k}-Domination and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of \(Y\)-dominating functions on graphs / 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: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank

Latest revision as of 02:25, 10 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
scientific article

    Statements

    On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    computational complexity
    0 references
    \(\{k\}\)-domination
    0 references
    \(k\)-tuple domination
    0 references
    split graphs
    0 references
    planar graphs
    0 references
    chordal graphs
    0 references

    Identifiers