✦ LIBER ✦

Most vital links and nodes in weighted networks

✍ Scribed by H.W Corley; David Y Sha

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 373 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90020-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Determining the most vital link in a flo

Determining the most vital link in a flow network

✍ S. H. Lubore; H. D. Ratliff; G. T. Sicilia 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

The most vital link in a single commodity flow network is that arc whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the networ

Finding the most vital arcs in a network

✍ Michael O. Ball; Bruce L. Golden; Rakesh V. Vohra 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Parallel Algorithm for Finding the Most

Parallel Algorithm for Finding the Most Vital Edge in Weighted Graphs

✍ Sudarshan Banerjee; Sanjeev Saxena 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Let G = (V, E) be a weighted undirected graph with n vertices and m edges; each edge e has a weight w(e) assigned to it. Let f(G) be the weight of a minimum spanning tree of G if G is connected; otherwise f(G) = ∞. The most vital edge of G is an edge e such that f(Ge) ≥ f(G -e′) for every other edge

Finding the most vital edge with respect

Finding the most vital edge with respect to minimum spanning tree in weighted graphs

✍ Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Load balancing in IP networks by optimis

Load balancing in IP networks by optimising link weights

✍ Mulyana, Eueung ;Killat, Ulrich 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

Competitive flow control in general mult

Competitive flow control in general multi-node multi-link communication networks

✍ Ismet Sahin; Marwan A. Simaan 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

## Abstract In this paper, we consider the flow control in a general multi‐node multi‐link communication network with competing users. Each user has a source node, a destination node, and an existing route for its data flow over any set of links in the network from its source to its destination nod