✦ 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
DOI: 10.1016/0169-7552(85)90004-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reducing the hierarchical network design

Reducing the hierarchical network design problem

✍ Cees Duin; Anton Volgenant 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 949 KB

An addendum to the hierarchical network

An addendum to the hierarchical network design problem

✍ C.W. Duin; A. Volgenant 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

The hierarchical network design problem

The hierarchical network design problem with multiple primary paths

✍ N.G.F. Sancho 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 340 KB

k-Partition-based facets of the network

k-Partition-based facets of the network design problem

✍ Yogesh K. Agarwal 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

Node-disjoint paths and related problems

Node-disjoint paths and related problems on hierarchical cubic networks

✍ Jung-Sheng Fu; Gen-Huey Chen; Dyi-Rong Duh 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

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