"Complexity and lowers bounds for Power Edge Set Problem."

Benoît Darties et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2018.11.006

access: closed

type: Journal Article

metadata version: 2019-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jda/DartiesCCGW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/DartiesCCGW18
Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms 52-53: 70-91 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.