An efficient construction of one-to-many node-disjoint paths in folded hypercubes

DOI10.1016/J.JPDC.2013.12.005MaRDI QIDQ2443019zbMATH OpenOpenAlexFDO

Authors Cheng-Nan Lai

Publication date 2 April 2014

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2013.12.005

zbMATH Keywords

folded hypercubehypercubematching problemnode-disjoint pathsoptimization problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• On Disjoint Shortest Paths Routing on the Hypercube
• scientific article; zbMATH DE number 1161303
• Path Embedding on Folded Hypercubes
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults

Cites work

• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Constructing one-to-many disjoint paths in folded hypercubes
• Cycles in folded hypercubes
• Efficient algorithms for finding maximum matching in graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Fault-free cycles in folded hypercubes with more faulty elements
• Generalized diameters and Rabin numbers of networks
• Graph theory with applications
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Many-to-many disjoint paths in faulty hypercubes
• Node-disjoint paths in hierarchical hypercube networks
• On conditional diagnosability of the folded hypercubes
• On the Rabin number problem
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Some edge‐fault‐tolerant properties of the folded hypercube
• Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• The spanning connectivity of folded hypercubes

Cited in

(6)

• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• One-to-one conditional path covers on augmented cubes
• Odd cycles embedding on folded hypercubes with conditional faulty edges
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Communication Performance Evaluation of the Locally Twisted Cube
• Set-to-set disjoint paths in a folded hypercube

This page was built for publication: An efficient construction of one-to-many node-disjoint paths in folded hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443019)