Publication

Un algoritmo polinomial para el problema de la equipartición sobre un grafo serie-paralelo

Thomas Liebling
1992
Journal paper

Abstract

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.

Official source

https://infoscience.epfl.ch/record/77131?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Un algoritmo polinomial para el problema de la equipartición sobre un grafo serie-paralelo

Graph Chatbot

Chat with Graph Search

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

Motif Cut Sparsifiers

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

Motif Cut Sparsifiers

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes