On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
From MaRDI portal
Publication:5951972
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex sets in (2) dimensions (including convex curves) (52A10)
Recommendations
- The size of maximal almost disjoint families
- On certain Matching Properties of Convex Sets
- Extremal theory for convex matchings in convex geometric graphs
- Tight bounds on maximal and maximum matchings
- scientific article; zbMATH DE number 2081000
- A compactness result for perfect matchings
- Bounds on maximum \(b\)-matchings
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Tight lower bounds on the size of a maximum matching in a regular graph
- On the maximum number of points in a maximal intersecting family of finite sets
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1182918 (Why is no real title available?)
- Approximation algorithms for the Geometric Covering Salesman Problem
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Computing simple circuits from a set of line segments
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- On the visibility graph of convex translates
Cited in
(3)
This page was built for publication: On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951972)
