Pages that link to "Item:Q1154916"
From MaRDI portal
The following pages link to Multicommodity flows in planar graphs (Q1154916):
Displaying 50 items.
- Criticality for multicommodity flows (Q473104) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Three commodity flows in graphs (Q594107) (← links)
- The hardness of routing two pairs on one face (Q662307) (← links)
- Ideal clutters (Q697573) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- Decomposition of graphs on surfaces and a homotopic circulation theorem (Q757396) (← links)
- A generalization of outerplanar graphs (Q799687) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- The weighted link ring loading problem (Q839671) (← links)
- Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
- Edge-disjoint paths in a grid bounded by two nested rectangles (Q913521) (← links)
- The Klein bottle and multicommodity flows (Q920100) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting (Q982669) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Disjoint paths in a rectilinear grid (Q1051655) (← links)
- Edge-disjoint paths in planar graphs (Q1069956) (← links)
- Algorithms for routing in planar graphs (Q1075054) (← links)
- Channel routing in knock-knee mode: Simplified algorithms and proofs (Q1091149) (← links)
- Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Distances and cuts in planar graphs (Q1121897) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
- Parity conditions in homotopic knock-knee routing (Q1207328) (← links)
- Algorithms for routing around a rectangle (Q1208452) (← links)
- On local routing of two-terminal nets (Q1210582) (← links)
- A minimax theorem on circuits in projective graphs (Q1255022) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Switchbox routing in VLSI design: Closing the complexity gap (Q1274317) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
- Routings for involutions of a hypercube (Q1315464) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Linkage on the infinite grid (Q1641161) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Multicommodity flows in graphs (Q1838904) (← links)
- A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
- Half-integral flows in a planar graph with four holes (Q1842657) (← links)
- Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
