A hybrid local search algorithm for minimum dominating set problems
Minimum dominating set (MDS) is a well-known NP-hard fundamental graph theory problem having many applications such as mining social networks and bioinformatics. MDS seeks for the minimum subset of vertices in which every vertex not in the selected subset is adjacent to at least one vertex of this s...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 出版: |
Elsevier Ltd
2022
|
| 在线阅读: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132527008&doi=10.1016%2fj.engappai.2022.105053&partnerID=40&md5=3039d1f8630093a54635c16e891d1c95 http://eprints.utp.edu.my/33322/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|