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

A note on practical construction of maximum bandwidth paths

โœ Scribed by Navneet Malpani; Jianer Chen

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
99 KB
Volume
83
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it has been proposed that a maximum bandwidth path be constructed by a modified Dijkstra's algorithm or by a modified Bellman-Ford algorithm. In this short note, we show that maximum bandwidth paths can be constructed by a modified Kruskal's algorithm. We demonstrate that this approach is simpler, easier in implementation, more flexible, and faster than the previously proposed algorithms.

๐Ÿ“œ SIMILAR VOLUMES

A note on parallel complexity of maximum
A note on parallel complexity of maximum f-matching
โœ Anders Dessmark; Oscar Garrido; Andrzej Lingas ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints. @ 1998 Elsevier Science B.V.

A note on construction of symmetrical PB
A note on construction of symmetrical PBIB designs
โœ P.S. Gill ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 319 KB

In this note initial block technique hzs been used for construction of some cl=s of ## 3-associate PBIB designs, known as rectangular desigus. Let A = MX S be the Cartesian produd of M and S, where .M = (a~, a lr. . . , qn\_3 is an additive group of order m and S = (0, I,. . . , s -1). I& a,l' de