Pages that link to "Item:Q551165"

The following pages link to An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165):

Displaying 16 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)
• Hamiltonian properties of honeycomb meshes (Q497228) (← links)
• Independent spanning trees on twisted cubes (Q663434) (← links)
• An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
• Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
• An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
• A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
• Structure fault tolerance of WK-recursive networks (Q2118867) (← links)
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← 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)
• A Hypercube Variant with Small Diameter (Q4978294) (← links)
• Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks (Q5250283) (← links)