Total (restrained) domination in unit disk graphs
From MaRDI portal
Publication:6614890
DOI10.1016/j.ic.2024.105210MaRDI QIDQ6614890
Yu Yang, Shou-Jun Xu, Cai-Xia Wang
Publication date: 8 October 2024
Published in: Information and Computation (Search for Journal in Brave)
approximation algorithmNP-completetotal dominating setunit disk graphtotal restrained dominating set
Cites Work
- Unnamed Item
- Unnamed Item
- NP-completeness and APX-completeness of restrained domination in graphs
- Design and analysis of approximation algorithms
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- A survey of selected recent results on total domination in graphs
- Unit disk graphs
- Restrained domination in graphs
- On total restrained domination in graphs
- Total domination in graphs
- Universality considerations in VLSI circuits
- The Complexity of Multiterminal Cuts
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Simple heuristics for unit disk graphs
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs
This page was built for publication: Total (restrained) domination in unit disk graphs
