The two-equal-disjoint path cover problem of matching composition network (Q963388)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-equal-disjoint path cover problem of matching composition network |
scientific article |
Statements
The two-equal-disjoint path cover problem of matching composition network (English)
0 references
19 April 2010
0 references
interconnection networks
0 references
matching composition networks
0 references
\(k\) disjoint path cover
0 references
two-equal-disjoint path cover
0 references
Hamiltonian-connectivity
0 references
