The Euclidean k-matching problem is NP-hard

Authors: José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López et al.
Publication: Computational Geometry
Published: Dec 1, 2026
Source: Crossref
Back to Search View Original Cite This Article

Related Articles

Factores de riesgo relacionados con trastornos en la conducta alimentaria en una comunidad de escolares

M Díaz Benavente, F Rodríguez Morilla et al. - Oct 2203

Read More
: Morphology, Taxonomy and Zoogeography of Argentinean Mammals: A tribute to José Yepes. T

Guillermo Cassini, Pablo Teta - Jan 2108

Read More
The scientific career of the zoologist José Yepes: collections, travels and zoogeography in the decades of 1930s and 1940s.

Susana Gracía - Jan 2108

Read More
Growth plate extracellular matrix-derived scaffolds for large bone defect healing

GM Cunniffe, PJ Díaz-Payno et al. - Feb 2107

Read More
Academic conferences promotion process and social media. Modeling of the problem

John Hlias Plikas, Dimitrios K. Nasiopoulos et al. - May 2100

Read More