𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Session F2: Interconnection networks for multiprocessors

✍ Scribed by Emilio Lopez Zapata

Publisher
Elsevier Science
Year
1991
Weight
106 KB
Volume
32
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Matching preclusion for some interconnec
Matching preclusion for some interconnection networks
✍ Eddie Cheng; LΓ‘szlΓ³ LiptΓ‘k πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 253 KB

## Abstract The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost‐perfect matchings. In this paper, we find this number for various classes of interconnection networks and classify all the optimal sol