Dual graph representation of transport networks
✍ Scribed by J. Añez; T. De La Barra; B. Pérez
- Book ID
- 116111940
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 609 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0191-2615
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract The design problem of two‐level MOS networks with a minimum number of cells is reduced to the covering problem of graphs with a minimum number of cliques. When every node of the graph corresponds to a minterm, an algorithm which generates an MOS network with a minimum number of cells i
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optic