Pages that link to "Item:Q2931436"
From MaRDI portal
The following pages link to Edge-disjoint paths in Planar graphs with constant congestion (Q2931436):
Displayed 12 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- The fractional congestion bound for efficient edge disjoint routing (Q3507649) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)