Complexity dichotomies for the Minimum F -Overlay problem - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Journal Articles Journal of Discrete Algorithms Year : 2018

Complexity dichotomies for the Minimum F -Overlay problem

Fichier principal
Vignette du fichier
jda-revised.pdf (395.04 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01947563 , version 1 (07-12-2018)

Identifiers

Cite

Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. Complexity dichotomies for the Minimum F -Overlay problem. Journal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩. ⟨hal-01947563⟩
216 View
150 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More