Algorithmic study on liar's vertex-edge domination problem
DOI10.1007/s10878-024-01208-9MaRDI QIDQ6646745
Debojyoti Bhattacharya, Subhabrata Paul
Publication date: 3 December 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
NP-completenessbipartite graphschordal graphsapproximation algorithmsliar's vertex-edge dominating set
Trees (05C05) 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Liar's domination in graphs
- Liar's domination in graphs: complexity and algorithm
- Double vertex-edge domination in graphs: complexity and algorithms
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Results on vertex-edge and independent vertex-edge domination
- Liar's domination in unit disk graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs
- Introduction to algorithms
- Liar's domination
- Total vertex-edge domination
- Double vertex-edge domination
- Global Vertex-Edge Domination Sets in Total Graph and Product Graph of Path Pn Cycle Cn
- Vertex-edge domination in graphs
- Vertex-edge domination in unit disk graphs
- Vertex-edge domination in graphs
This page was built for publication: Algorithmic study on liar's vertex-edge domination problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646745)
