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.
Complexity and lowers bounds for Power Edge Set Problem [link]Paper  doi  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},
  url          = {https://doi.org/10.1016/j.jda.2018.11.006},
  doi          = {10.1016/J.JDA.2018.11.006},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/DartiesCCGW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0