Pages that link to "Item:Q954985"
From MaRDI portal
The following pages link to Fault-tolerant embedding of paths in crossed cubes (Q954985):
Displayed 13 items.
- Embedding a mesh of trees in the crossed cube (Q436621) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
- Efficient unicast in bijective connection networks with the restricted faulty node set (Q545351) (← links)
- Embedding meshes into twisted-cubes (Q545387) (← links)
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes (Q656607) (← links)
- Fault tolerance in \(k\)-ary \(n\)-cube networks (Q690475) (← links)
- Fault tolerance in bubble-sort graph networks (Q764377) (← links)
- Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
- Fault-tolerant panconnectivity of augmented cubes (Q1034902) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)