Algorithmic aspects of upper paired-domination in graphs (Q2283034): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dinabandhu Pradhan / rank
Normal rank
 
Property / author
 
Property / author: Dinabandhu Pradhan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2019.10.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2983456581 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126834989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity Landscape of the Domination Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Domination: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of upper domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of distance paired-domination problem in 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: Distance paired-domination problems on subclasses of 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: Paired domination on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2878211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper total domination versus upper paired-domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper paired-domination in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in 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: Edge weighting functions on semitotal dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithm for the paired-domination problem in convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal graphs and upper irredundance, upper domination and independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / 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: A linear time recognition algorithm for proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a minimum paired-dominating set in strongly orderable graphs / 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: Edge Weighting Functions on Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The paired-domination and the upper paired-domination numbers of graphs / rank
 
Normal rank

Latest revision as of 08:53, 21 July 2024

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

    Statements

    Algorithmic aspects of upper paired-domination in graphs (English)
    0 references
    0 references
    0 references
    27 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    domination
    0 references
    paired domination
    0 references
    upper paired domination
    0 references
    polynomial-time algorithm
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references