An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes

DOI10.1006/JPDC.2000.1632MaRDI QIDQ1579747zbMATH OpenOpenAlexFDO

Authors Qian-Ping Gu, Shietung Peng

Publication date 8 February 2001

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

Full work available at URL https://doi.org/10.1006/jpdc.2000.1632

zbMATH Keywords

node-disjoint pathshypercubesinterconnection topologies

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 219253
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• scientific article; zbMATH DE number 1161303
• On Disjoint Shortest Paths Routing on the Hypercube
• Paired many-to-many disjoint path covers of the hypercubes

Cited in

(18)

• Two spanning disjoint paths with required length in generalized hypercubes
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• On Disjoint Shortest Paths Routing on the Hypercube
• Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
• scientific article; zbMATH DE number 219253 (Why is no real title available?)
• Disjoint paths in hypercubes with prescribed origins and lengths
• One-to-one disjoint path covers on multi-dimensional tori
• An efficient algorithm for k-pairwise disjoint paths in star graphs
• An efficient construction of one-to-many node-disjoint paths in folded hypercubes
• scientific article; zbMATH DE number 1475207 (Why is no real title available?)
• An algorithm on disjoint paths in enhanced hypercubes
• scientific article; zbMATH DE number 1555951 (Why is no real title available?)
• Node-disjoint paths in a level block of generalized hierarchical completely connected networks
• One-to-many node-disjoint paths of hyper-star networks
• Node-disjoint paths in hierarchical hypercube networks
• Set-to-set disjoint paths in a folded hypercube
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• Fault tolerance of hypercube like networks: spanning laceability under edge faults

This page was built for publication: An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes

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