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...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Article |
| 出版: |
2019
|
| 在线阅读: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85060844898&partnerID=40&md5=7b545b80056bffe0c1494f3c5cd4745d http://eprints.utp.edu.my/22208/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|