Pages that link to "Item:Q545351"
From MaRDI portal
The following pages link to Efficient unicast in bijective connection networks with the restricted faulty node set (Q545351):
Displaying 25 items.
- The restricted \(h\)-connectivity of the data center network DCell (Q260051) (← links)
- On the \(t/k\)-diagnosability of BC networks (Q275756) (← links)
- A fast fault-identification algorithm for bijective connection graphs using the PMC model (Q454914) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- Hamiltonian properties of honeycomb meshes (Q497228) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- Two-round diagnosability measures for multiprocessor systems (Q781778) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
- The strong local diagnosability of a hypercube network with missing edges (Q1632895) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- The spined cube: a new hypercube variant with smaller diameter (Q1944950) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- The minimum spectral radius of an edge-removed network: a hypercube perspective (Q2398757) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Path and cycle fault tolerance of bubble-sort graph networks (Q2420577) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Changing the diameter of the locally twisted cube (Q2852108) (← links)
- The congestion of generalized cube communication pattern in linear array network (Q2929617) (← links)
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices (Q4639925) (← links)
- A Hypercube Variant with Small Diameter (Q4978294) (← links)
- Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks (Q5250283) (← links)
- Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction (Q6130228) (← links)
