An algorithm for the secure total domination problem in proper interval graphs
type: Item
instance of: scholarly article
title: An algorithm for the secure total domination problem in proper interval graphs
author: Toru Araki
author: Yasufumi Aita
published in: Theoretical Computer Science
publication date: 2024-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7899137
zbMATH Keywords: secure total dominating set
zbMATH Keywords: dominating set
zbMATH Keywords: total dominating set
zbMATH Keywords: proper interval graph
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
cites work: Secure total domination number in maximal outerplanar graphs
cites work: Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
cites work: On the secure domination numbers of maximal outerplanar graphs
cites work: Q5503336
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: On minimum secure dominating sets of graphs
cites work: Q3065457
cites work: New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
cites work: Q5461685
cites work: Q5871911
cites work: Secure total domination in graphs: bounds and complexity
cites work: Algorithmic graph theory and perfect graphs
cites work: Secure total domination in chain graphs and cographs
cites work: Secure domination and secure total domination in graphs
cites work: On secure domination in trees
cites work: Optimal greedy algorithms for indifference graphs
cites work: Algorithmic results in secure total dominating sets on graphs
cites work: Total 2-domination of proper interval graphs
cites work: Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
DOI: 10.1016/J.TCS.2024.114706
description: scientific article; zbMATH DE number 7899137