Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2227301424 / rank | |||
Normal rank | |||
Revision as of 19:49, 19 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
