Pages that link to "Item:Q293380"
From MaRDI portal
The following pages link to An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380):
Displaying 6 items.
- On strong Menger-connectivity of star graphs (Q1406044) (← 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)
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (Q2361079) (← links)
- Linearly many faults in Cayley graphs generated by transposition trees (Q2456457) (← links)
- (Q5708565) (← links)
- Set-to-set disjoint paths in a folded hypercube (Q6495788) (← links)
