An O(k~2n~2) Algorithm to Find a kPartition in a kConnected Graph

Abstract
Although there are polynomial algorithms of finding a 2partition or a 3partition for a simple undirected 2connected or 3connected graph respectively, there is no general algorithm of finding a kpartition for a kconnected graph G = (V, E), where k is the vertex connectivity of G. In this paper, an O(k2n2) general algorithm of finding a kpartition for a kconnected graph is proposed, where n = V.

