Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs |
scientific article |
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
