Connected liar's domination in graphs: complexity and algorithms
DOI10.1142/S1793830913500249zbMATH Open1280.05103OpenAlexW2083328367MaRDI QIDQ2874035FDOQ2874035
Authors: B. S. Panda, S. Paul 
Publication date: 28 January 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830913500249
Recommendations
- Liar's domination in graphs: complexity and algorithm
- Liar's domination in graphs
- Liar's domination in graphs
- Hardness results and approximation algorithm for total liar's domination in graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- On the total liar's domination of graphs
- Liar's dominating sets in graphs
- Liar's domination in graphs under some operations
- Liar's domination in Sierpinski-like graphs
- Bounds on co-independent liar's domination in graphs
approximation algorithmgraph algorithmNP-completenessdominationchordal graphliar's dominationAPX-completeness
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Paired-domination in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Liar's domination in graphs
- Liar's domination
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Permutation graphs: Connected domination and Steiner trees
Cited In (8)
- A linear time algorithm for liar's domination problem in proper interval graphs
- Liar's dominating sets in graphs
- Hardness results and approximation algorithm for total liar's domination in graphs
- Algorithmic study on liar's vertex-edge domination problem
- On the total liar's domination of graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Liar's domination in graphs: complexity and algorithm
- Liar's domination in unit disk graphs
This page was built for publication: Connected liar's domination in graphs: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874035)
