News
Event
People
Projects
Publications
Research Lines
Heuristicas.es
Optsicom
Contact
English
Español
Minimum dominating set
An iterated greedy algorithm for finding the minimum dominating set in graphs
A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The …
A. Casado
,
S. Bermudo
,
A. D. López-Sánchez
,
J. Sánchez-Oro
Cite
DOI
URL
Cite
×