The two-equal-disjoint path cover problem of matching composition network (Q963388)
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: The two-equal-disjoint path cover problem of matching composition network |
scientific article; zbMATH DE number 5694947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-equal-disjoint path cover problem of matching composition network |
scientific article; zbMATH DE number 5694947 |
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
