An algorithm for the secure total domination problem in proper interval graphs
From MaRDI portal
Publication:6590080
DOI10.1016/J.TCS.2024.114706MaRDI QIDQ6590080
Could not fetch data.
Publication date: 21 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
polynomial-time algorithmdominating settotal dominating setproper interval graphsecure total dominating set
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On the secure domination numbers of maximal outerplanar graphs
- Secure total domination in graphs: bounds and complexity
- Algorithmic graph theory and perfect graphs
- Total 2-domination of proper interval graphs
- Algorithmic results in secure total dominating sets on graphs
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Optimal greedy algorithms for indifference graphs
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Secure domination and secure total domination in graphs
- Secure total domination in chain graphs and cographs
- On minimum secure dominating sets of graphs
- On secure domination in trees
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
- Secure total domination number in maximal outerplanar graphs
This page was built for publication: An algorithm for the secure total domination problem in proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590080)
