The algorithm and complexity of co-secure domination in geometric intersection graphs

DOI10.1007/s40314-024-02982-2MaRDI QIDQ6653927

Shou-Jun Xu, Cai-Xia Wang, Yu Yang

Publication date: 17 December 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmNP-completeAPX-hardgeometric intersection graphsco-secure domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hamiltonian properties of supergrid graphs
• On connected domination in unit ball graphs
• Hamiltonian circuits in interval graph generalizations
• A better heuristic for orthogonal graph drawings
• Some APX-completeness results for cubic graphs
• The co-secure domination in proper interval graphs
• Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
• Universality considerations in VLSI circuits
• Domination in Geometric Intersection Graphs
• Complexity results on cosecure domination in graphs
• Algorithmic aspects of secure domination in unit disk graphs
• On the complexity of co-secure dominating set problem

This page was built for publication: The algorithm and complexity of co-secure domination in geometric intersection graphs