Pages that link to "Item:Q1154916"
From MaRDI portal
The following pages link to Multicommodity flows in planar graphs (Q1154916):
Displaying 30 items.
- An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (Q2010919) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (Q2149491) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Isometric embedding of Busemann surfaces into \(L_1\) (Q2256580) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- An algorithm for node-capacitated ring routing (Q2467482) (← links)
- Multicommodity flows in cycle graphs (Q2499583) (← links)
- A Note on the Ring Loading Problem (Q2790401) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- A Mixed Integer Model for the Sparsest Cut problem (Q2883559) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes (Q3194707) (← links)
- On Canonical Concurrent Flows, Crossing Number and Graph Expansion (Q4325335) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Improved approximations for the minimum-cut ratio and the flux (Q4866679) (← links)
- (Q5020877) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- When Do Gomory--Hu Subtrees Exist? (Q5088606) (← links)
- (Q5111733) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring (Q5936466) (← links)
- (Q6087213) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
