Optimizing Reachability Sets in Temporal Graphs by Delaying

Argyrios Deligkas, Igor Potapov. Optimizing Reachability Sets in Temporal Graphs by Delaying. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020. pages 9810-9817, AAAI Press, 2020. [doi]

@inproceedings{DeligkasP20,
  title = {Optimizing Reachability Sets in Temporal Graphs by Delaying},
  author = {Argyrios Deligkas and Igor Potapov},
  year = {2020},
  url = {https://aaai.org/ojs/index.php/AAAI/article/view/6533},
  researchr = {https://researchr.org/publication/DeligkasP20},
  cites = {0},
  citedby = {0},
  pages = {9810-9817},
  booktitle = {The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020},
  publisher = {AAAI Press},
  isbn = {978-1-57735-823-7},
}