𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A graph partition problem

✍ Scribed by Yanpei Liu; Morgana Aurora; Simeone Bruno

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1996
Tongue
English
Weight
584 KB
Volume
12
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The bottleneck graph partition problem
The bottleneck graph partition problem
✍ Hochbaum, Dorit S.; Pathria, Anu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 401 KB πŸ‘ 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

A note on the bottleneck graph partition
A note on the bottleneck graph partition problem
✍ Klinz, Bettina; Woeginger, Gerhard J. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 47 KB πŸ‘ 2 views

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 wit

The optimal graph partitioning problem
The optimal graph partitioning problem
✍ SΓΈren Holm; Michael Malmros SΓΈrensen πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 German βš– 791 KB