Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm
The minimum dominating set (MDS) is the problem of finding the minimum number of nodes that have connections to all other nodes in a given graph. This problem belongs to the NP-complete complexity class that cannot be solved exactly in a polynomial time. Hence, we deployed a stochastic method to est...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 出版: |
Springer
2020
|
| 在线阅读: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077767130&doi=10.1007%2f978-3-030-33582-3_37&partnerID=40&md5=8fba0ba61fd9ae440848dd2b8598441c http://eprints.utp.edu.my/24751/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|