A linear time algorithm for liar's domination problem in proper interval graphs

DOI10.1016/J.IPL.2013.07.012MaRDI QIDQ2445259zbMATH OpenOpenAlexFDO

Authors B. S. Panda, S. Paul

Publication date 14 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.07.012

zbMATH Keywords

graph algorithmsliar's dominationproper interval graphsundirected path graphs

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

• Liar's domination in graphs: complexity and algorithm
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs
• Connected liar's domination in graphs: complexity and algorithms
• scientific article; zbMATH DE number 6470870
• Hardness results and approximation algorithm for total liar's domination in graphs

Cites work

• A linear time recognition algorithm for proper interval graphs
• A recognition algorithm for the intersection graphs of paths in trees
• Dominating Sets in Chordal Graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• scientific article; zbMATH DE number 4152428 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Incidence matrices and interval graphs
• Liar's domination
• Liar's domination in graphs
• On the Algorithmic Complexity of Total Domination
• Total domination in interval graphs

Cited in

(17)

• Linear algorithm for domatic number problem on interval graphs
• Liar's domination in graphs: complexity and algorithm
• Hardness results and approximation algorithm for total liar's domination in graphs
• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
• On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs
• Liar's dominating set problem on unit disk graphs
• Liar's domination in unit disk graphs
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
• Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs
• Liar's domination in 2D
• Liar's dominating sets in graphs
• Total Roman domination for proper interval graphs
• Liar's domination in Sierpinski-like graphs
• Algorithmic study on liar's vertex-edge domination problem
• Various bounds for liar's domination number
• Fault tolerant detectors for distinguishing sets in graphs

This page was built for publication: A linear time algorithm for liar's 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 Q2445259)