Un algorithmo polinomial para el problema de la equipartición sobre un arbol

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 a smallest cost. We present a polynomial algorithm to solve the equipartition problem on a tree.


Published in:
III Encuentro Fisica, Matemática, Informática y sus aplicaciones, 139-142
Year:
1991
Note:
PRO 91.07
Laboratories:




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


Rate this document:

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