An algorithm on disjoint paths in enhanced hypercubes

MaRDI QIDQ4604144zbMATH OpenFDO

Authors Dan Jin, Hongmei Liu

Publication date 23 February 2018

zbMATH Keywords

enhanced hypercubesinternal disjoint pathsrouting function

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• The maximum number of disjoint paths in faulty enhanced hypercubes
• Edge disjoint paths in enhanced hypercube with conditional faults
• scientific article; zbMATH DE number 1161303
• On Disjoint Shortest Paths Routing on the Hypercube
• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes

Cited in

(3)

• Node-disjoint paths in hierarchical hypercube networks
• On Disjoint Shortest Paths Routing on the Hypercube
• Disjoint paths in hypercubes with prescribed origins and lengths

This page was built for publication: An algorithm on disjoint paths in enhanced hypercubes

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