Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
From MaRDI portal
Publication:2700783
DOI10.1016/j.tcs.2023.113824OpenAlexW4360603692MaRDI QIDQ2700783
Yu Yang, Shou-Jun Xu, Cai-Xia Wang
Publication date: 27 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113824
approximation algorithmNP-completeunit disk graphsrectangle graphssecure total dominationsecure connected domination
Related Items (2)
Binary programming formulations for the upper domination problem ⋮ Algorithmic aspects of secure domination in unit disk graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian circuits in interval graph generalizations
- Label placement by maximum independent set in rectangles
- A better heuristic for orthogonal graph drawings
- Some APX-completeness results for cubic graphs
- Secure total domination in graphs: bounds and complexity
- Algorithmic aspects of secure connected domination in graphs
- Algorithmic results in secure total dominating sets on graphs
- Complexity of approximating bounded variants of optimization problems
- Independent set of intersection graphs of convex objects in 2D
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
- Approximation schemes for covering and packing problems in image processing and VLSI
- Universality considerations in VLSI circuits
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Polynomial-time approximation schemes for packing and piercing fat objects
- Secure total domination in chain graphs and cographs
- Algorithmic complexity of secure connected domination in graphs
- Domination in Geometric Intersection Graphs
This page was built for publication: Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
