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.


Published in:
Politécnica Revista de Información Técnico - Científica, 17, 3, 31-36
Year:
1992
Note:
PRO 92.09
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)