Pages that link to "Item:Q764341"
From MaRDI portal
The following pages link to Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341):
Displaying 5 items.
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (Q1579747) (← 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)