A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (Q2039695): 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.1007/978-3-030-57602-8_40 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3048011305 / rank | |||
Normal rank | |||
Revision as of 23:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes |
scientific article |
Statements
A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (English)
0 references
5 July 2021
0 references
edge-disjoint Hamiltonian cycles
0 references
crossed cubes
0 references
interconnection networks
0 references
