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.002MaRDI QIDQ6157427zbMATH OpenFDO

Authors Toru Araki, Ryuya Saito

Publication date 11 May 2023

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

Full work available at URL https://doi.org/10.1016/J.DAM.2023.04.002

zbMATH Keywords

dominationlinear time algorithmproper interval graphssecure domination

Mathematics Subject Classification ID

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

Recommendations

• A simple algorithm for secure domination in proper interval graphs
• Total domination in interval graphs revisited
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• Secure domination in proper interval graphs
• The co-secure domination in proper interval graphs

Cites work

• A linear algorithm for secure domination in trees
• A simple algorithm for secure domination in proper interval graphs
• Algorithmic graph theory and perfect graphs
• Co-secure and secure domination in graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• Graphs \& digraphs
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• On minimum secure dominating sets of graphs
• On secure domination in graphs
• On secure domination in trees
• On the secure domination numbers of maximal outerplanar graphs
• Optimal greedy algorithms for indifference graphs
• Secure domination and secure total domination in graphs
• Secure domination in cographs
• Secure domination in proper interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The co-secure domination in proper interval graphs
• The secure domination problem in cographs

Cited in

(6)

• Total domination in interval graphs revisited
• A simple algorithm for secure domination in proper interval graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
• An algorithm for the secure total domination problem in proper interval graphs
• A lower bound for secure domination number of an outerplanar graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157427)