科研之友
微信
新浪微博
Facebook
分享链接
摘要
A maximum partition of a directed weighted graph is partitioning the nodes into two sets such that is maximizes the total weights of edges between the two sets. In this study a genetic algorithm it proposed to solve the maximum partition problem. Experiments performed on randomly generated graphs of different sizes show that the proposed algorithm converges to an optimal solution faster than the existing heuristic algorithm.
- 出版日期2002
