The following pages link to (Q3972951):
Displayed 44 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems (Q444377) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- The hardness of routing two pairs on one face (Q662307) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Path packing and a related optimization problem (Q841602) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Modeling hypergraphs by graphs with the same mincut properties (Q1209979) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs (Q1329812) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- On extremal multiflows (Q1850477) (← links)
- On multiflow lexicographics (Q1864616) (← links)
- Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- On the fractionality of the path packing problem (Q1928498) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- On the maximum degree of path-pairable planar graphs (Q2415080) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- Routing in grid graphs by cutting planes (Q4845139) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)