๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hierarchical networks and the subnetwork partition problem

โœ Scribed by Radia Perlman


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
513 KB
Volume
9
Category
Article
ISSN
0169-7552

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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