The following pages link to William H. Cunningham (Q949789):
Displaying 50 items.
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs (Q949790) (← links)
- Decomposition of submodular functions (Q1053717) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- Short cocircuits in binary matroids (Q1101114) (← links)
- On submodular function minimization (Q1104332) (← links)
- Separating cocircuits in binary matroids (Q1165248) (← links)
- \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
- (Q1241752) (redirect page) (← links)
- Chords and disjoint paths in matroids (Q1241753) (← links)
- An unbounded matroid intersection polyhedron (Q1244236) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- Principally unimodular skew-symmetric matrices (Q1307441) (← links)
- A faster algorithm for computing the strength of a network (Q1318743) (← links)
- A separation algorithm for the matchable set polytope (Q1334957) (← links)
- Wheel inequalities for stable set polytopes (Q1373764) (← links)
- Computing the binding number of a graph (Q1813976) (← links)
- Matching, matroids, and extensions (Q1849530) (← links)
- On the even permutation polytope (Q1887623) (← links)
- The coming of the matroids (Q1946016) (← links)
- Restricted 2-factor polytopes (Q1970297) (← links)
- Compositions for perfect graphs (Q2266722) (← links)
- On dual integrality in matching problems (Q2314407) (← links)
- Optimal 3-terminal cuts and linear programming (Q2490332) (← links)
- Integral Solutions of Linear Complementarity Problems (Q2757523) (← links)
- Reductions to 1–matching polyhedra (Q3039038) (← links)
- BINARY MATROID SUMS (Q3205245) (← links)
- A submodular network simplex method (Q3220318) (← links)
- On cycling in the network simplex method (Q3664851) (← links)
- A Primal-Dual Algorithm for Submodular Flows (Q3680637) (← links)
- The Partial Order of a Polymatroid Extreme Point (Q3696865) (← links)
- Minimum cuts, modular functions, and matroid polyhedra (Q3703586) (← links)
- Improved Bounds for Matroid Partition and Intersection Algorithms (Q3756518) (← links)
- Optimal attack and reinforcement of a network (Q3767103) (← links)
- A Combinatorial Decomposition Theory (Q3884147) (← links)
- Converting Linear Programs to Network Problems (Q3885552) (← links)
- (Q3909066) (← links)
- (Q3929414) (← links)
- (Q3932815) (← links)
- (Q3932816) (← links)
- (Q3955180) (← links)
- Polyhedra for Composed Independence Systems (Q3955366) (← links)
- (Q3958239) (← links)
- Decomposition of Directed Graphs (Q3960725) (← links)
- Small Travelling Salesman Polytopes (Q3978615) (← links)
- (Q4035360) (← links)
- (Q4056042) (← links)
- (Q4091998) (← links)
- A network simplex method (Q4123079) (← links)
- (Q4165400) (← links)
- (Q4197644) (← links)
