Loading...
conference paper
Un algorithmo polinomial para el problema de la equipartición sobre un arbol
1991
III Encuentro Fisica, Matemática, Informática y sus aplicaciones
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.
Type
conference paper
Author(s)
Date Issued
1991
Published in
III Encuentro Fisica, Matemática, Informática y sus aplicaciones
Start page
139
End page
142
Note
PRO 91.07
Written at
EPFL
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record