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.
PDF References Citation
How to cite this article
- Horowitz, E. and S. Sahni, 1978. Fundamentals of Computer Algorithms. Computer Science Publishers, Rockville, Md., ISBN-10: 0914894226.
- Fuhr, N. and T. Rolleke, 1997. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inform. Syst., 15: 32-66.