The following pages link to (Q4474098):
Displaying 16 items.
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- Match-bounds revisited (Q1041044) (← links)
- On the maximum 2-1 matching (Q1095813) (← links)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767) (← links)
- Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- (Q2721984) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- (Q3024804) (← links)
- Maximum Neighbour Voronoi Games (Q3605489) (← links)
- A Min-Max Theorem for a Constrained Matching Problem (Q4337736) (← links)
- Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732) (← links)
- Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427) (← links)
- A simply exponential upper bound on the maximum number of stable matchings (Q5230350) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
