On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
DOI10.1016/S0166-218X(01)00202-5zbMATH Open0998.52001WikidataQ126324090 ScholiaQ126324090MaRDI QIDQ5951972FDOQ5951972
Authors: Kiyoshi Hosono 
Publication date: 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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
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)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for the Geometric Covering Salesman Problem
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
