Pré-publication, Document de travail, GALaC, Complexité, Computational Complexity, Computer Science

Minimum colored maximum matching is NP-hard on trees

Jonas Sénizergues. Minimum colored maximum matching is NP-hard on trees. 2018. ⟨hal-01827567⟩

Published on