𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Correct and almost complete diagnosis of processor grids

✍ Scribed by Chessa, S.; Maestrini, P.

Book ID
119773295
Publisher
IEEE
Year
2001
Tongue
English
Weight
685 KB
Volume
50
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tenacity of complete graph products and
Tenacity of complete graph products and grids
✍ Choudum, S. A.; Priya, N. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 73 KB πŸ‘ 2 views

Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various parameters like connectivity, toughness, integrit

Diagnosis of Proteus syndrome was correc
Diagnosis of Proteus syndrome was correct
✍ Kirk, Edwin P. ;Smith, Janine M. ;Field, Michael ;Marshall, Glenn M. ;Marsh, Deb πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 48 KB
Almost resolvable Pk-decompositions of c
Almost resolvable Pk-decompositions of complete graphs
✍ Min-Li Yu πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 925 KB

## Abstract An almost __P__~__k__~‐factor of __G__ is a __P__~__k__~‐factor of __G__ ‐ {__v__} for some vertex __v.__ An almost resolvable __P__~__k__~‐decomposition of Ξ»__K__~__n__~ is a partition of the edges of Ξ»__K__~__n__~ into almost __P__~__k__~‐factors. We prove that necessary and sufficien