The following pages link to (Q5675543):
Displaying 50 items.
- Fractional matroid matchings (Q1812954) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- On structures of bisubmodular polyhedra (Q1814796) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- An identity for bipartite matching and symmetric determinant (Q1894478) (← links)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems (Q2052179) (← links)
- Oriented hypergraphs: balanceability (Q2124629) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals (Q2313415) (← links)
- On dual integrality in matching problems (Q2314407) (← links)
- Spectra of cycle and path families of oriented hypergraphs (Q2321360) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- On degree sequences of undirected, directed, and bidirected graphs (Q2359981) (← links)
- A connection between Hadamard matrices, oriented hypergraphs and signed graphs (Q2361554) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- An algorithmic approach to dual integrality of matching and extensions (Q2419581) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Optimum matching forests II: General weights (Q3922479) (← links)
- (Q4017559) (← links)
- An efficient algorithm for minimumk-covers in weighted graphs (Q4083700) (← links)
- On the integer-valued variables in the linear vertex packing problem (Q4136929) (← links)
- Maximum matching of given weight in complete and complete bipartite graphs (Q4206784) (← links)
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition (Q4522112) (← links)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- Halin graphs and the travelling salesman problem (Q4744083) (← links)
- Matching, Euler tours and the Chinese postman (Q4766817) (← links)
- Generalizing Kirchhoff laws for Signed Graphs (Q5026988) (← links)
- (Q5061404) (← links)
- (Q5091021) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- A bidirected generalization of network matrices (Q5487806) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- Algorithms (Q5905704) (← links)
