Complexity dichotomies for the Minimum F -Overlay problem - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles Journal of Discrete Algorithms Year : 2018

Complexity dichotomies for the Minimum F -Overlay problem

Domains

Discrete Mathematics [cs.DM]
Fichier principal
Vignette du fichier
jda-revised.pdf (395.04 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Frederic Havet  : Connect in order to contact the contributor

https://inria.hal.science/hal-01947563

Submitted on : Friday, December 7, 2018-7:24:35 AM

Last modification on : Tuesday, November 12, 2024-3:20:07 PM

Long-term archiving on : Friday, March 8, 2019-1:39:35 PM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENS-LYON CNRS INRIA UNIV-LYON1 I3S UMR8623 ALGCO LIRMM CENTRALESUPELEC INRIA2 TDS-MACS UNIV-PARIS-SACLAY MIPS UNIV-MONTPELLIER UNIV-COTEDAZUR UDL ANR LISN GS-COMPUTER-SCIENCE LISN-GALAC
241 View
181 Download

Altmetric

Share

More