Pages that link to "Item:Q3581428"
From MaRDI portal
The following pages link to Hardness of the undirected edge-disjoint paths problem (Q3581428):
Displaying 9 items.
- The complexity of minimum convex coloring (Q415283) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- The maximum edge-disjoint paths problem in complete graphs (Q930909) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
