𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A P-complete graph partition problem

✍ Scribed by R. Sarnath; Xin He

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
881 KB
Volume
76
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A graph partition problem
A graph partition problem
✍ Yanpei Liu; Morgana Aurora; Simeone Bruno πŸ“‚ Article πŸ“… 1996 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 584 KB
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

Complete partitions of graphs
Complete partitions of graphs
✍ MagnΓΊs M. HalldΓ³rsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Si πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 393 KB
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