Algorithmic results in secure total dominating sets on graphs
From MaRDI portal
Publication:2136269
DOI10.1016/J.TCS.2022.03.016OpenAlexW4221042980MaRDI QIDQ2136269FDOQ2136269
Authors: Abolfazl Poureidi 
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.016
Recommendations
Cites Work
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Title not available (Why is that?)
- Approximation hardness of dominating set problems in bounded degree graphs
- The complexity of domination problems in circle graphs
- Secure domination and secure total domination in graphs
- Secure total domination in graphs
- Secure total domination in chain graphs and cographs
- The complexity of secure domination problem in graphs
- Domination in the corona and join of graphs
- Secure total domination in graphs: bounds and complexity
Cited In (7)
- A simple algorithm for secure domination in proper interval graphs
- On computing secure domination of trees
- An algorithm for the secure total domination problem in proper interval graphs
- PTASs for secure dominating set in planar graphs and growth-bounded graphs
- A Gröbner-Shirshov algorithm for applications in internet security
- Algorithmic aspects of 2-secure domination in graphs
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
This page was built for publication: Algorithmic results in secure total dominating sets on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136269)
