An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
From MaRDI portal
Publication:1579747
DOI10.1006/jpdc.2000.1632zbMath0957.68006OpenAlexW1968025843MaRDI QIDQ1579747
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
Network design and communication in computer systems (68M10) General topics in the theory of software (68N01)
Related Items
Node-disjoint paths in hierarchical hypercube networks ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ 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 ⋮ Disjoint paths in hypercubes with prescribed origins and lengths ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ One-to-one disjoint path covers on multi-dimensional tori
