Logo image
Sign in
Complexity and lowers bounds for Power Edge Set Problem
Journal article   Peer reviewed

Complexity and lowers bounds for Power Edge Set Problem

Benoit Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau and Mathias Weller
Journal of Discrete Algorithms, Vol.52-53, pp.70-91
09/2018

Abstract

Phasor measurement unit Power Edge Set Complexity Approximation algorithm Treewidth
url
Find in HALView

Metrics

1 Record Views

Details

Logo image