Learning Algorithm for the Uniform Graph Partitioning Problem

C. B. Chua and Kan Chen
Additional contact information
C. B. Chua: Department of Computational Science, Faculty of Science, National University of Singapore, Republic of Singapore 119260, Singapore
Kan Chen: Department of Computational Science, Faculty of Science, National University of Singapore, Republic of Singapore 119260, Singapore

International Journal of Modern Physics C (IJMPC), 1998, vol. 09, issue 02, 331-339

Abstract: We study the uniform graph partitioning problem using the learning algorithm proposed by one of us. We discuss the characteristics of the learning algorithm and compare the performance of the algorithm empirically with the Kernighan–Lin algorithm on a range of instances. Even with a simple implementation, the learning algorithm is capable of producing very good results.

Keywords: Learning Algorithm; Genetic Algorithm; Graph Partitioning Problem; Optimization (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S012918319800025X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:09:y:1998:i:02:n:s012918319800025x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S012918319800025X

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().