Liebling, Th. M.Vaca, P.2006-02-132006-02-132006-02-131992https://infoscience.epfl.ch/handle/20.500.14299/222701The 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.text::journal::journal article::research article