Pages that link to "Item:Q1579747"
From MaRDI portal
The following pages link to An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (Q1579747):
Displaying 11 items.
- One-to-many node-disjoint paths of hyper-star networks (Q442216) (← links)
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341) (← links)
- Node-disjoint paths in a level block of generalized hierarchical completely connected networks (Q1929239) (← links)
- 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 (Q1959418) (← links)
- Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
- Node-disjoint paths in hierarchical hypercube networks (Q2384539) (← links)
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019) (← links)
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups (Q2512654) (← links)
- One-to-one disjoint path covers on multi-dimensional tori (Q5248088) (← links)
- Disjoint paths in hypercubes with prescribed origins and lengths (Q5747712) (← links)
- Set-to-set disjoint paths in a folded hypercube (Q6495788) (← links)
