Complexity and lowers bounds for Power Edge Set Problem. Darties, B., Champseix, N., Chateau, A., Giroudeau, R., & Weller, M. J. Discrete Algorithms, 52-53:70–91, 2018.
bibtex   
@article{DBLP:journals/jda/DartiesCCGW18,
  author       = {Beno{\^{\i}}t Darties and
                  Nicolas Champseix and
                  Annie Chateau and
                  Rodolphe Giroudeau and
                  Mathias Weller},
  title        = {Complexity and lowers bounds for Power Edge Set Problem},
  journal      = {J. Discrete Algorithms},
  volume       = {52-53},
  pages        = {70--91},
  year         = {2018}
}

Downloads: 0