Hybrid bat algorithm for minimum dominating set problem
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
IOS Press
2017
|
| Online Access: | 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/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!