Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Paired many-to-many disjoint path covers in restricted hypercube-like graphs |
scientific article; zbMATH DE number 6581633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Paired many-to-many disjoint path covers in restricted hypercube-like graphs |
scientific article; zbMATH DE number 6581633 |
Statements
Paired many-to-many disjoint path covers in restricted hypercube-like graphs (English)
0 references
18 May 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.9543631672859192
0 references
0.914452075958252
0 references
0.893405020236969
0 references
0.8792871832847595
0 references
