Hybrid bat algorithm for minimum dominating set problem

• Main Authors: Abed, S.A., Rais, H.M.
• 格式: Article
• 出版: IOS Press 2017
• 在线阅读: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029897973&doi=10.3233%2fJIFS-17398&partnerID=40&md5=4d739c0c7fb803691ad68857b82cfaeb; http://eprints.utp.edu.my/19724/

Graph domination is one of the NP-Complete problems that cannot be solved exactly in polynomial time. Hence, we propose a stochastic approach to tackle the minimum dominating set problem (MDS). The main aim of MDS is to find the minimum number of nodes that covers all other nodes in a graph. Thus, w...