Complexity and lowers bounds for Power Edge Set Problem - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Discrete Algorithms Year : 2018

Dates and versions

lirmm-01950398 , version 1 (10-12-2018)

Identifiers

Cite

Benoit Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Complexity and lowers bounds for Power Edge Set Problem. Journal of Discrete Algorithms, 2018, 52-53, pp.70-91. ⟨10.1016/j.jda.2018.11.006⟩. ⟨lirmm-01950398⟩
169 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More