Node-disjoint paths in hierarchical hypercube networks
From MaRDI portal
Publication:2384539
DOI10.1016/j.ins.2007.02.035zbMath1126.68016OpenAlexW2057613339MaRDI QIDQ2384539
Yu-Liang Kuo, Gen-Huey Chen, Ruei-Yu Wu, Gerard Jennhwa Chang
Publication date: 10 October 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/154729
Related Items (19)
Two node-disjoint paths in balanced hypercubes ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ Diameter variability of cycles and tori ⋮ Conditional fault diagnosis of hierarchical hypercubes ⋮ On \(g\)-extra conditional diagnosability of hierarchical cubic networks ⋮ The triangular pyramid: Routing and topological properties ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Reliability analysis and fault tolerance for hypercube multi-computer networks ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ Conditional matching preclusion sets ⋮ Long paths in hypercubes with conditional node-faults ⋮ Distance-based polynomials and topological indices for hierarchical hypercube networks ⋮ On Component Connectivity of Hierarchical Star Networks ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ On some multiplicative version topological indices of block shift and hierarchical hypercube networks
Cites Work
- Unnamed Item
- Unnamed Item
- Hyper Hamiltonian laceability on edge fault star graph
- Longest fault-free paths in hypercubes with vertex faults
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Programming languages and system architectures. International conference, Zurich, Switzerland, March 2-4, 1994. Proceedings
- An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
- Generalized diameters of the mesh of trees
- On embedding cycles into faulty twisted cubes
- Strong Rabin numbers of folded hypercubes
- Wide diameter and minimum length of disjoint Menger path systems
- Efficient dispersal of information for security, load balancing, and fault tolerance
- On the Rabin number problem
- Node‐disjoint paths and related problems on hierarchical cubic networks
This page was built for publication: Node-disjoint paths in hierarchical hypercube networks
