Publication

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

Thomas Liebling
1992
Journal Articles

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

Graph Chat

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

Chat with Graph Search

HeNCler: Node Clustering in Heterophilous Graphs via Learned Asymmetric Similarity

Graph Coloring Problems

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results