On minimum stars and maximum matchings.
From MaRDI portal
Publication:1972312
DOI10.1007/PL00009508zbMath1112.68476MaRDI QIDQ1972312
Sándor P. Fekete, Henk G. Meijer
Publication date: 26 April 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
On stars and Steiner stars ⋮ Improved upper bounds for the Steiner ratio ⋮ On maximum-sum matchings of points ⋮ Intersecting ellipses induced by a max-sum matching ⋮ On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours ⋮ New bounds on the average distance from the Fermat-Weber center of a planar convex body ⋮ On the number of similar instances of a pattern in a finite set ⋮ Worst-case ratios of networks in the rectilinear plane
This page was built for publication: On minimum stars and maximum matchings.