Complexity of distance paired-domination problem in graphs (Q1758170): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of trees with equal paired and double domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithms for domination problems in sun-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling algorithms for paired-domination problems in block and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for paired-domination problem in strongly chordal graphs / 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: Distance paired-domination problems on subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired domination on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for the paired-domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and multidimensional matching in chordal and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance paired domination numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of chordal graphs as subtrees of a tree / rank
 
Normal rank

Latest revision as of 21:09, 5 July 2024

scientific article
Language Label Description Also known as
English
Complexity of distance paired-domination problem in graphs
scientific article

    Statements

    Complexity of distance paired-domination problem in graphs (English)
    0 references
    0 references
    8 November 2012
    0 references
    distance \(k\)-dominating set
    0 references
    distance \(k\)-paired-dominating set
    0 references
    strongly chordal graph
    0 references
    undirected path graph
    0 references
    NP-complete
    0 references
    approximation algorithm
    0 references
    APX-complete
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references