Pages that link to "Item:Q765478"
From MaRDI portal
The following pages link to Embedding meshes/tori in faulty crossed cubes (Q765478):
Displaying 24 items.
- Embeddings of circulant networks (Q358657) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Embedding a mesh of trees in the crossed cube (Q436621) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← 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)
- Construction of the mesh and the torus tolerating a large number of faults (Q676440) (← links)
- Multiple regular graph embeddings into a hypercube with unbounded expansion (Q902523) (← links)
- Embedding a family of meshes into twisted cubes (Q975481) (← links)
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube (Q975501) (← links)
- Embedding a family of disjoint 3D meshes into a crossed cube (Q1031688) (← links)
- Super spanning connectivity on WK-recursive networks (Q1694677) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
- Embedding meshes into crossed cubes (Q2372214) (← links)
- Embedding of hypercubes into sibling trees (Q2449051) (← links)
- Embedding of the folded hypercubes into tori (Q2516503) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
- Embedding meshes in hypercubes with edge faults (Q4208595) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
