On the \(p\)-reinforcement and the complexity (Q2253958): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q329722
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-013-9597-9 / rank
Normal rank
 
Property / author
 
Property / author: Jun-Ming Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127379330 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.4013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5709011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the \(p\)-domination number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and reinforcement numbers in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the k-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on total reinforcement in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the bondage and reinforcement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinforcement numbers of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total reinforcement number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Application of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4655867 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-013-9597-9 / rank
 
Normal rank

Latest revision as of 16:54, 17 December 2024

scientific article
Language Label Description Also known as
English
On the \(p\)-reinforcement and the complexity
scientific article

    Statements

    On the \(p\)-reinforcement and the complexity (English)
    0 references
    0 references
    0 references
    0 references
    16 February 2015
    0 references
    domination
    0 references
    \(p\)-domination
    0 references
    \(p\)-reinforcement
    0 references
    NP-hard
    0 references

    Identifiers