The following pages link to Matroids and multicommodity flows (Q1161527):
Displaying 48 items.
- A survey on flows in graphs and matroids (Q298967) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- Lattice flows in networks (Q522926) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Ideal clutters (Q697573) (← links)
- Antisymmetric flows in matroids (Q852703) (← links)
- Compressed polytopes and statistical disclosure limitation (Q875709) (← links)
- On Hilbert bases of cuts (Q898132) (← links)
- Detecting minors in matroids through triangles (Q901153) (← links)
- Pfaffian graphs, \(T\)-joins and crossing numbers (Q949784) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- Decomposition of regular matroids (Q1144028) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions (Q1569057) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- The hypermetric cone and polytope on eight vertices and some generalizations (Q1745770) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Master polytopes for cycles of binary matroids (Q1824625) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Compositions for matroids with the Fulkerson property (Q1900139) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- Hilbert bases of cuts (Q1916115) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- Generalized cut and metric polytopes of graphs and simplicial complexes (Q2174869) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- A generalized cut-condition for multiflows in matroids (Q2366020) (← links)
- On the complexity of the disjoint paths problem (Q2367446) (← links)
- Trader multiflow and box-TDI systems in series-parallel graphs (Q2419363) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- Colouring series-parallel graphs (Q2640612) (← links)
- Enumeration of the facets of cut polytopes over some highly symmetric graphs (Q2827757) (← links)
- Templates for Binary Matroids (Q2968512) (← links)
- The Excluded Minors for Isometric Realizability in the Plane (Q2968517) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Minimum cycle coverings and integer flows (Q3353054) (← links)
- Nowhere zero 4‐flow in regular matroids (Q5462388) (← links)
- Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups (Q6063833) (← links)
