A note on the bottleneck graph partition problem

A note on the bottleneck graph partition problem

0.00 Avg rating0 Votes
Article ID: iaor20022448
Country: United States
Volume: 33
Issue: 3
Start Page Number: 189
End Page Number: 191
Publication Date: May 1999
Journal: Networks
Authors: ,
Keywords: networks
Abstract:

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem with running time O(n2), where n is the number of vertices in the graph. Our result answers an open problem posed in a recent paper by Hochbaum and Pathria.

Reviews

Required fields are marked *. Your email address will not be published.