Pages that link to "Item:Q1373868"
From MaRDI portal
The following pages link to Routing a permutation in the hypercube by two sets of edge disjoint paths (Q1373868):
Displaying 15 items.
- An invariant extension method for system area networks of multicore computational systems. An ideal system network (Q544768) (← links)
- A \(d\)-move local permutation routing for the \(d\)-cube (Q674437) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- Embedding multidimensional grids into optimal hypercubes (Q740976) (← links)
- Generalized crossed rings-multirings with a decreased degree of node (Q885847) (← links)
- Routing permutations on graphs via factors (Q1273853) (← links)
- Routings for involutions of a hypercube (Q1315464) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- From Hall's matching theorem to optimal routing on hypercubes (Q1569034) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- The generalized folding-cube network (Q3204022) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- 2-1 routing requests in the hypercube (Q3439394) (← links)
- (Q5441058) (← links)
- Routing permutations and 2-1 routing requests in the hypercube (Q5948960) (← links)