Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. Cazals, P., Darties, B., Chateau, A., Giroudeau, R., & Weller, M. In Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pages 122–135, 2019.
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/iwoca/CazalsDCGW19,
  author       = {Pierre Cazals and
                  Beno{\^{\i}}t Darties and
                  Annie Chateau and
                  Rodolphe Giroudeau and
                  Mathias Weller},
  title        = {Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  pages        = {122--135},
  year         = {2019},
  crossref     = {DBLP:conf/iwoca/2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_11},
  doi          = {10.1007/978-3-030-25005-8\_11},
  timestamp    = {Mon, 15 Jul 2019 15:43:10 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/CazalsDCGW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0