The following pages link to Matching theory (Q1088987):
Displaying 20 items.
- Equistarable bipartite graphs (Q279223) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Convex nonnegative matrix factorization with manifold regularization (Q889387) (← links)
- Geometry of the space of phylogenetic trees (Q1604344) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- Regularized nonnegative shared subspace learning (Q1944970) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- Perfect matchings in planar cubic graphs (Q2454587) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- The Alcuin Number of a Graph (Q3541095) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
