Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6536808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs |
scientific article; zbMATH DE number 6536808 |
Statements
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (English)
0 references
28 January 2016
0 references
hypercube-like graph
0 references
disjoint path
0 references
path cover
0 references
path partition
0 references
fault tolerance
0 references
interconnection network
0 references
0 references
0.9754398465156556
0 references
0.9444491863250732
0 references
0.9012255668640136
0 references
0.8787508606910706
0 references
0.8677850961685181
0 references
