An Algorithm for Partitioning the Nodes of a Graph

Abstract

Let $G = \{ N,E \}$ be an undirected graph having nodes N and edges E. We consider the problem of partitioning N into k disjoint subsets $N_1 , \cdots ,N_k $ of given sizes $m_1 , \cdots ,m_k $, respectively, in such a way that the number of edges in E that connect different subsets is minimal. We obtain a heuristic solution from the solution of a linear programming transportation problem.