On VLSI layouts of the star graph and related networks
✍ Scribed by Ondrej Sýkora; Imrich Vrt'o
- Book ID
- 107920231
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 513 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-9260
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The hierarchy of the star graph allows the assignment of its special subgraphs (substars), which have the same topological features as the original graph, to a sequence of incoming tasks. The procedure for task allocation in the star graph can be done using the star code and the allocation tree cons
## Abstract Let __u__ and __v__ be any two distinct nodes of an undirected graph __G__, which is __k__‐connected. A container __C__(__u__,__v__) between __u__ and __v__ is a set of internally disjoint paths {__P__~1~,__P__~2~,…,__P__~__w__~} between __u__ and __v__ where 1 ≤ __w__ ≤ __k__. The widt