Longest fault-free paths in hypercubes with vertex faults
From MaRDI portal
Publication:819312
DOI10.1016/J.INS.2005.01.011zbMath1088.68019OpenAlexW2045428420MaRDI QIDQ819312
Publication date: 28 March 2006
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2005.01.011
Related Items (42)
Two node-disjoint paths in balanced hypercubes ⋮ Embedding meshes into crossed cubes ⋮ Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Node-disjoint paths in hierarchical hypercube networks ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ On reliability of the folded hypercubes ⋮ Hamiltonian laceability of bubble-sort graphs with edge faults ⋮ Long cycles in hypercubes with optimal number of faulty vertices ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ Super \(\lambda_3\)-optimality of regular graphs ⋮ Embedded paths and cycles in faulty hypercubes ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\) ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Path embedding in faulty hypercubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Long paths in hypercubes with a quadratic number of faults ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ Long paths in hypercubes with conditional node-faults ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Hamiltonian connectivity of the WK-recursive network with faulty nodes ⋮ Survey on path and cycle embedding in some networks ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant cycle embedding in the hypercube
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Hyper Hamiltonian laceability on edge fault star graph
- Hamiltonicity of the hierarchical cubic network
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Efficient Gossiping by Packets in Networks with Random Faults
This page was built for publication: Longest fault-free paths in hypercubes with vertex faults
