Computational comparison of major proposed methods for graph partitioning problem
k-way graph partitioning is an NP-complete problem, which is applied to various tasks such as route planning, image segmentation, community detection, and high-performance computing. The approximate methods constitute a useful solution for these types of problems. Thus, many research studies have fo...
保存先:
主要な著者: | Rais, H.M., Abed, S.A., Watada, J. |
---|---|
フォーマット: | 論文 |
出版事項: |
2019
|
オンライン・アクセス: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85060844898&partnerID=40&md5=7b545b80056bffe0c1494f3c5cd4745d http://eprints.utp.edu.my/22208/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm
著者:: Abed, S.A., 等
出版事項: (2020) -
On some packing and partition problems in geometric graphs
著者:: Trao, Hazim Michman
出版事項: (2018) -
The partitioning technique of directed cyclic graph for task assignment problem
著者:: Ariffin, W. N. M., 等
出版事項: (2016) -
Graph partitioning method for functional module detections of protein interaction network
著者:: A., Afnizanfaizal, 等
出版事項: (2009) -
A hybrid local search algorithm for minimum dominating set problems
著者:: Abed, S.A., 等
出版事項: (2022)