Pages that link to "Item:Q1031688"
From MaRDI portal
The following pages link to Embedding a family of disjoint 3D meshes into a crossed cube (Q1031688):
Displaying 14 items.
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- A novel algorithm to embed a multi-dimensional torus into a locally twisted cube (Q533891) (← links)
- Embedding meshes into twisted-cubes (Q545387) (← links)
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube (Q621616) (← links)
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes (Q656607) (← links)
- Embedding of tori and grids into twisted cubes (Q708230) (← links)
- Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube (Q975501) (← links)
- The triangular pyramid: Routing and topological properties (Q985070) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
