Routing permutations and 2-1 routing requests in the hypercube (Q5948960): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4944978 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rearrangeable circuit-switched hypercube architectures for routing permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Routing a permutation in the hypercube by two sets of edge disjoint paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counterexample to a conjecture of Szymanski on hypercube routing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Routings for involutions of a hypercube / rank | |||
Normal rank | |||
Revision as of 21:21, 3 June 2024
scientific article; zbMATH DE number 1672485
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Routing permutations and 2-1 routing requests in the hypercube |
scientific article; zbMATH DE number 1672485 |
Statements
Routing permutations and 2-1 routing requests in the hypercube (English)
0 references
28 April 2002
0 references
directed symmetric \(n\)-dimensional hypercube
0 references
Szymanski's conjecture
0 references
