Algorithmic results in secure total dominating sets on graphs

DOI10.1016/J.TCS.2022.03.016MaRDI QIDQ2136269zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

NP-completelinear-time algorithmAPX-completesecure total dominating set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Secure total domination in graphs: bounds and complexity
• Secure total domination in chain graphs and cographs
• The complexity of secure domination problem in graphs
• On secure domination in graphs
• Secure domination and secure total domination in graphs

Cites work

• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• Approximation hardness of dominating set problems in bounded degree graphs
• Domination in the corona and join of graphs
• Optimization, approximation, and complexity classes
• Secure domination and secure total domination in graphs
• Secure total domination in chain graphs and cographs
• Secure total domination in graphs
• Secure total domination in graphs: bounds and complexity
• Some APX-completeness results for cubic graphs
• The complexity of domination problems in circle graphs
• The complexity of secure domination problem in graphs

Cited in

(7)

• An algorithm for the secure total domination problem in proper interval graphs
• Algorithmic aspects of 2-secure domination in graphs
• PTASs for secure dominating set in planar graphs and growth-bounded graphs
• A Gröbner-Shirshov algorithm for applications in internet security
• On computing secure domination of trees
• Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
• A simple algorithm for secure domination in proper interval 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)