Pages that link to "Item:Q287065"

The following pages link to Node-to-set disjoint paths problem in star graphs (Q287065):

Displaying 8 items.

• An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380) (← links)
• On the construction of all shortest node-disjoint paths in star networks (Q903371) (← links)
• One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
• Short containers in Cayley graphs (Q1028103) (← links)
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs (Q2466076) (← links)
• Conditional fault-tolerant routing of (<i>n</i>,<i>k</i>)-star graphs (Q2957750) (← links)
• Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs (Q3057177) (← links)
• Set-to-set disjoint paths in a folded hypercube (Q6495788) (← links)