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

An effective routing algorithm in incomplete hypercubes

โœ Scribed by Shu-Hua Hu; Hsing-Lung Chen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
940 KB
Volume
20
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Algorithm for the k-Pairwis
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
โœ Qian-Ping Gu; Shietung Peng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype

An effective numerical method for contro
An effective numerical method for controlled routing in large trunk line networks
โœ Harold J. Kushner; Jichuan Yang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

The paper discusses a powerful approach to the routing problem in large networks of the trunk line type. The approximations are based on heavy traffic limit theorems. The sequence of suitably normalized available circuits converges to a reflected diffusion process as the size of the network grows, u