ICNPAA 2010: Mathematical Problems in
Engineering, Aerospace and Sciences

In this paper, the authors propose a new algorithm for the Node Swapping Method in graph partitioning. Here, the proposed algorithm modifies that method so that any number of graph or network's nodes can be partitioned into any optional number of subsets (preferably into a divisible respect). The application of given method on the some random graphs is also validated by well-known Complete Search Method. The final conclusions show a good improvement in time processing and error values with respect to the other old methods.