Improved Complexity for Power Edge Set Problem. Darties, B., Chateau, A., Giroudeau, R., & Weller, M. In Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, pages 128–141, 2017.
Improved Complexity for Power Edge Set Problem [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/iwoca/DartiesCGW17,
  author       = {Beno{\^{\i}}t Darties and
                  Annie Chateau and
                  Rodolphe Giroudeau and
                  Mathias Weller},
  title        = {Improved Complexity for Power Edge Set Problem},
  booktitle    = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
                  Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
  pages        = {128--141},
  year         = {2017},
  crossref     = {DBLP:conf/iwoca/2017},
  url          = {https://doi.org/10.1007/978-3-319-78825-8\_11},
  doi          = {10.1007/978-3-319-78825-8\_11},
  timestamp    = {Sun, 06 Oct 2024 21:10:18 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/DartiesCGW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0