Conference paper

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.


    PRO 91.07


    • ROSO-CONF-1991-002

    Record created on 2006-02-13, modified on 2016-08-08


  • There is no available fulltext. Please contact the lab or the authors.

Related material