Efficient unicast in bijective connection networks with the restricted faulty node set
From MaRDI portal
Publication:545351
DOI10.1016/J.INS.2010.12.011zbMATH Open1216.68056OpenAlexW2036896089WikidataQ60402434 ScholiaQ60402434MaRDI QIDQ545351FDOQ545351
Authors: Jianxi Fan, Shukui Zhang, Jia Yu, Xin Liu, X.-H. Jia 
Publication date: 22 June 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.12.011
Recommendations
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Linearly Many Edge-Faults in 2-Bijective Connection Networks
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- One-to-one communication in twisted cubes under restricted connectivity
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
Cites Work
- Long paths in hypercubes with conditional node-faults
- Conditional connectivity
- Fault-tolerant cycle embedding in the hypercube
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Path embedding in faulty hypercubes
- Locally twisted cubes are 4-pancyclic.
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- The Mobius cubes
- The locally twisted cubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Embedding meshes into locally twisted cubes
- Longest fault-free paths in hypercubes with vertex faults
- Path bipancyclicity of hypercubes
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Fault-tolerant Hamiltonicity of twisted cubes
- Title not available (Why is that?)
- Fault-tolerant embedding of paths in crossed cubes
- Fault tolerance of Möbius cubes under two forbidden fault set models
Cited In (25)
- Paths and cycles identifying vertices in twisted cubes
- The restricted \(h\)-connectivity of the data center network DCell
- An efficient algorithm to construct disjoint path covers of DCell networks
- Independent spanning trees on twisted cubes
- The spined cube: a new hypercube variant with smaller diameter
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
- On the \(t/k\)-diagnosability of BC networks
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Changing the diameter of the locally twisted cube
- One-to-one disjoint path covers on alternating group graphs
- A Hypercube Variant with Small Diameter
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- Path and cycle fault tolerance of bubble-sort graph networks
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- Two-round diagnosability measures for multiprocessor systems
- The congestion of generalized cube communication pattern in linear array network
- Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
- Constructing completely independent spanning trees in crossed cubes
- The minimum spectral radius of an edge-removed network: a hypercube perspective
- Hamiltonian properties of honeycomb meshes
- An algorithm to construct independent spanning trees on parity cubes
- The strong local diagnosability of a hypercube network with missing edges
- Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction
This page was built for publication: Efficient unicast in bijective connection networks with the restricted faulty node set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545351)
