1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/104809
DC FieldValue
dc.titleLearning algorithm for the uniform graph partitioning problem
dc.contributor.authorChua, C.B.
dc.contributor.authorChen, K.
dc.date.accessioned2014-10-28T03:12:07Z
dc.date.available2014-10-28T03:12:07Z
dc.date.issued1998-03
dc.identifier.citationChua, C.B., Chen, K. (1998-03). Learning algorithm for the uniform graph partitioning problem. International Journal of Modern Physics C 9 (2) : 331-339. ScholarBank@NUS Repository.
dc.identifier.issn01291831
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104809
dc.description.abstractWe 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.
dc.sourceScopus
dc.subjectGenetic Algorithm
dc.subjectGraph Partitioning Problem
dc.subjectLearning Algorithm
dc.subjectOptimization
dc.typeArticle
dc.contributor.departmentCOMPUTATIONAL SCIENCE
dc.description.sourcetitleInternational Journal of Modern Physics C
dc.description.volume9
dc.description.issue2
dc.description.page331-339
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.