A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets

Xinyun Wu,Zhipeng Lü,Fred Glover

A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets

2021

Xinyun Wu
Zhipeng Lü
Fred Glover

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:

minimum dominating set
Vertex (geometry)
Combinatorics
local search
undirected graph
Set (abstract data type)
Connected dominating set
Weighting
Metaheuristic
Mathematics

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations