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/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料