Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136): 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.2012.07.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028613978 / rank
 
Normal rank
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: Classes of bipartite graphs related to chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / 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: Characterizations of strongly chordal graphs / 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: Incidence matrices and interval graphs / 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: \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple total domination in cross products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: On the Algorithmic Complexity of Total Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank

Latest revision as of 20:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic aspects of \(k\)-tuple total domination in graphs
scientific article

    Statements

    Algorithmic aspects of \(k\)-tuple total domination in graphs (English)
    0 references
    0 references
    0 references
    23 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    domination
    0 references
    total domination
    0 references
    \(k\)-tuple total domination
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    0 references