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: | Abed, S.A., Rais, H.M. |
---|---|
格式: | 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/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
A hybrid local search algorithm for minimum dominating set problems
由: Abed, S.A., et al.
出版: (2022)
由: Abed, S.A., et al.
出版: (2022)
相似書籍
-
Hybrid bat algorithm for minimum dominating set problem
由: Abed, S.A., et al.
出版: (2017) -
A hybrid local search algorithm for minimum dominating set problems
由: Abed, S.A., et al.
出版: (2022) -
A hybrid local search algorithm for minimum dominating set problems
由: Abed, S.A., et al.
出版: (2022) -
Computational comparison of major proposed methods for graph partitioning problem
由: Rais, H.M., et al.
出版: (2019) -
A Genetic Algorithm Based Approach for Solving
the Minimum Dominating Set of Queens Problem
由: Alharbi, Saad, et al.
出版: (2017)