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

Minimum-congestion hypergraph embedding in a cycle

โœ Scribed by Ganley, J.L.; Cohoon, J.P.

Book ID
119772652
Publisher
IEEE
Year
1997
Tongue
English
Weight
53 KB
Volume
46
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On minimizing the maximum congestion for
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
โœ SingLing Lee; Hann-Jang Ho ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 77 KB

The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exact

Minimum bandwidth problem for embedding
Minimum bandwidth problem for embedding graphs in cycles
โœ Lin, Yixun ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 98 KB ๐Ÿ‘ 2 views

For the bandwidth B(G) and the cyclic bandwidth B c (G) of a graph G, it is known that 1 2 B(G) ยฐBc (G) ยฐB(G). In this paper, the criterion conditions for two extreme cases B c (G) ร… B(G) and B c (G) ร… 1 2 B(G) are studied. From this, some exact values of B c (G) for special graphs can be obtained.