On computing a minimum secure dominating set in block graphs-Reference-Cited by-同舟云学术

On computing a minimum secure dominating set in block graphs

Published:2017-11-08 Issue:2 Volume:35 Page:613-631
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Pradhan D.,Jha Anupriya

Funder

Science and Engineering Research Board (IN)

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-017-0197-y/fulltext.html

Reference23 articles.

1. Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithm. Addison-wesley, Reading

2. Booth KS, Johnson JH (1974) Dominating sets in chordal graphs. SIAM J Comput 9:205–212

3. Brandstädt A, Le VB, Spinrad JP (1999) Graph classes: a survey. SIAM, Philadelphia

4. Burger AP, Cockayne EJ, Gründlingh WR, Mynhardt CM, van Vuuren JH, Winterbach W (2004) Finite order domination in graphs. J Comb Math Comb Comput 49:159–175

5. Burger AP, Henning MA, van Vuuren JH (2008) Vertex covers and secure domination in graphs. Quaest Math 31:12–17

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PTASs for secure dominating set in planar graphs and growth-bounded graphs;Discrete Applied Mathematics;2024-11

2. A lower bound for secure domination number of an outerplanar graph;Discrete Applied Mathematics;2024-11

3. On maximal Roman domination in graphs: complexity and algorithms;RAIRO - Operations Research;2024-07

4. Algorithmic aspects of secure domination in unit disk graphs;Information and Computation;2023-12

5. A Game Theoretic Approach for a Minimal Secure Dominating Set;IEEE/CAA Journal of Automatica Sinica;2023-12