Learning Algorithm for the Uniform Graph Partitioning Problem
1998 ◽
Vol 09
(02)
◽
pp. 331-339
◽
Keyword(s):
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.
1999 ◽
Vol 82
(12)
◽
pp. 34-42
◽
2020 ◽
Vol 8
(3-4)
◽
pp. 289-308
◽
Keyword(s):
1987 ◽
Vol 21
(4)
◽
pp. 349-364
◽
1995 ◽
pp. 392-397
◽
2010 ◽
Vol 48
(1)
◽
pp. 57-71
◽
1996 ◽
Vol 8
(1)
◽
pp. 61-84
◽