research article
Un algoritmo polinomial para el problema de la equipartición sobre un grafo serie-paralelo
The equipartition problem on an undirected graph G=(V,E), with n nodes and a system of edge weights, is to find a subset of [n/2] nodes such as the associate cut has the smallest cost. We present a polynomial algorithm to solve the equipartition problem on a series-parallel graph.
Type
research article
Author(s)
Vaca, P.
Date Issued
1992
Volume
17
Issue
3
Start page
31
End page
36
Note
PRO 92.09
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record