Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang

DOI10.1016/j.dam.2023.04.002zbMath1512.05317MaRDI QIDQ6157427

Ryuya Saito, Toru Araki

Publication date: 11 May 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear time algorithmdominationproper interval graphssecure domination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Secure domination in proper interval graphs
• On the secure domination numbers of maximal outerplanar graphs
• The secure domination problem in cographs
• A simple algorithm for secure domination in proper interval graphs
• Algorithmic graph theory and perfect graphs
• The co-secure domination in proper interval graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• On secure domination in graphs
• Optimal greedy algorithms for indifference graphs
• Secure domination in cographs
• A linear algorithm for secure domination in trees
• Secure domination and secure total domination in graphs
• On minimum secure dominating sets of graphs
• On secure domination in trees

This page was built for publication: Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang