The following pages link to Algorithms and Computation (Q5897940):
Displaying 16 items.
- On the \(t/k\)-diagnosability of BC networks (Q275756) (← links)
- Geodesic pancyclicity of twisted cubes (Q424780) (← links)
- Vertex-pancyclicity of augmented cubes with maximal faulty edges (Q726559) (← links)
- Node-pancyclicity and edge-pancyclicity of hypercube variants (Q845952) (← links)
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements (Q884473) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- Structure fault tolerance of WK-recursive networks (Q2118867) (← links)
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges (Q2258909) (← links)
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) (Q2474073) (← links)
- Connectivity and constructive algorithms of disjoint paths in dragonfly networks (Q2672591) (← links)
- Optimal embedding of hypercube into cylinder (Q2672634) (← links)
- Vertex-pancyclicity of twisted cubes with maximal faulty edges (Q4903570) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes (Q6038696) (← links)
