Pages that link to "Item:Q2390375"
From MaRDI portal
The following pages link to Constructing the nearly shortest path in crossed cubes (Q2390375):
Displaying 8 items.
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube (Q621616) (← links)
- Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
- The triangular pyramid: Routing and topological properties (Q985070) (← links)
- Two-node-Hamiltonicity of enhanced pyramid networks (Q985080) (← links)
- Conditional edge-fault Hamiltonicity of augmented cubes (Q985082) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
- Independent spanning trees in crossed cubes (Q5920317) (← links)
