Pages that link to "Item:Q5516087"
From MaRDI portal
The following pages link to Maximum matching and a polyhedron with 0,1-vertices (Q5516087):
Displaying 50 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Equistarable bipartite graphs (Q279223) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
- A survey on flows in graphs and matroids (Q298967) (← links)
- The cost of perfection for matchings in graphs (Q299061) (← links)
- Enhancing complex network controllability by minimum link direction reversal (Q315957) (← links)
- Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
- A two-stage decomposition of high school timetabling applied to cases in Denmark (Q336881) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- On extremal \(k\)-supereulerian graphs (Q383349) (← links)
- Covering a cubic graph with perfect matchings (Q393450) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Cycle double covers and the semi-Kotzig frame (Q412256) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Certifying algorithms (Q465678) (← links)
- Avoiding 7-circuits in 2-factors of cubic graphs (Q470948) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Age-based preferences in paired kidney exchange (Q523519) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Design tools for reporter strands and DNA origami scaffold strands (Q529038) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- König-Egerváry graphs are non-Edmonds (Q605001) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- The perfect matching polytope and solid bricks (Q705886) (← links)
- A note on balanced bipartitions (Q709305) (← links)
