Infoscience

Journal 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.

    Note:

    PRO 92.09

    Reference

    • ROSO-ARTICLE-1992-003

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

Fulltext

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

Related material