scholarly journals Lower bounds to the graph partitioning problem through generalized linear programming and network flows

1987 ◽  
Vol 21 (4) ◽  
pp. 349-364 ◽  
Author(s):  
M. Minoux ◽  
E. Pinson
Keyword(s):  
Linear Programming ◽  
Lower Bounds ◽  
Graph Partitioning ◽  
Network Flows ◽  
Graph Partitioning Problem ◽  
Generalized Linear Programming ◽  
Partitioning Problem

Learning Algorithm for the Uniform Graph Partitioning Problem

1998 ◽  
Vol 09 (02) ◽  
pp. 331-339 ◽  
Author(s):  
C. B. Chua ◽  
Kan Chen
Keyword(s):  
Graph Partitioning ◽  
Learning Algorithm ◽  
Graph Partitioning Problem ◽  
Simple Implementation ◽  
Partitioning Problem

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.

Sign in / Sign up

Export Citation Format

Share Document