On computing a minimum secure dominating set in block graphs (Q1702842): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-017-0197-y / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-017-0197-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767964623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Covers and Secure Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for secure domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum secure dominating sets of 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: Node-searching problem on block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundance, secure domination and maximum degree in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination critical 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: Optimal vertex ranking of block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination and secure total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secure domination in graphs / 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: \(k\)-power domination in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in block graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-017-0197-Y / rank
 
Normal rank

Latest revision as of 04:55, 11 December 2024

scientific article
Language Label Description Also known as
English
On computing a minimum secure dominating set in block graphs
scientific article

    Statements

    On computing a minimum secure dominating set in block graphs (English)
    0 references
    0 references
    0 references
    1 March 2018
    0 references
    domination
    0 references
    secure domination
    0 references
    block graphs
    0 references
    linear time algorithm
    0 references
    NP-completeness
    0 references

    Identifiers