One-to-one disjoint path covers on alternating group graphs (Q476856): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.09.041 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/YouFHJ15 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.09.041 / rank | |||
Normal rank | |||
Latest revision as of 18:41, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-to-one disjoint path covers on alternating group graphs |
scientific article |
Statements
One-to-one disjoint path covers on alternating group graphs (English)
0 references
2 December 2014
0 references
alternating group graph
0 references
one-to-one disjoint path covers
0 references
interconnection network
0 references
parallel computing
0 references
0 references
