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...

詳細記述

保存先:
書誌詳細
主要な著者: Abed, S.A., Rais, H.M.
フォーマット: 論文
出版事項: 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/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料