Transformation of edge weights in a graph bipartitioning problem

  • Authors:

  • I. M. Karandashe;B. V. Kryzhanovsky

  • Affiliations:

  • Center of Optical and Neural Technologies of SRISA RAS, Moscow, Russia;Center of Optical and Neural Technologies of SRISA RAS, Moscow, Russia

  • Venue:
  • ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the problem of partitioning a graph into two parts of equal sizes with minimal sum of edge weights between them. It is known that this problem is NP-complete and can be reduced to the minimization of a quadratic binary functional with constraints. In previous work it was shown that raising the matrix of couplings to some power leads to a significant increase of the basin of attraction of the deepest functional minima. This means that such transformation possesses great optimizing abilities. In this paper we show that in spite of the constraints present in the graph bipartitioning problem, the proposed matrix transformation approach works very well with this problem.