A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
2021
The minimum connected dominating set (MCDS) problem consists of selecting a minimum set of vertices from an undirected graph, such that each vertex not in this set is adjacent to at least one of th...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
38
References
0
Citations
NaN
KQI