A linear algorithm for secure domination in trees
From MaRDI portal
Publication:2449101
DOI10.1016/j.dam.2014.02.001zbMath1288.05189OpenAlexW2030324691MaRDI QIDQ2449101
Jan H. van Vuuren, Alewyn P. Burger, Anton P. de Villiers
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.001
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
An improved binary programming formulation for the secure domination problem ⋮ Secure domination in proper interval graphs ⋮ Secure domination in cographs ⋮ On the secure domination numbers of maximal outerplanar graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Algorithmic aspects of secure domination in unit disk graphs ⋮ On computing a minimum secure dominating set in block graphs ⋮ The complexity of secure domination problem in graphs ⋮ The secure domination problem in cographs ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ Eternal and Secure Domination in Graphs ⋮ The secure domination number of Cartesian products of small graphs with paths and cycles ⋮ On secure domination in trees ⋮ On computing secure domination of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithms for dominating set
- Irredundance, secure domination and maximum degree in trees
- Secure domination critical graphs
- A linear algorithm for the domination number of a tree
- Linear algorithms on recursive representations of trees
- Vertex Covers and Secure Domination in Graphs
This page was built for publication: A linear algorithm for secure domination in trees
