A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. Brandt, S., Emek, Y., Uitto, J., & Wattenhofer, R. In Chatzigiannakis, I., Indyk, P., Kuhn, F., & Muscholl, A., editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, volume 80, of LIPIcs, pages 82:1–82:13, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/icalp/BrandtEUW17,
  author    = {Sebastian Brandt and
               Yuval Emek and
               Jara Uitto and
               Roger Wattenhofer},
  editor    = {Ioannis Chatzigiannakis and
               Piotr Indyk and
               Fabian Kuhn and
               Anca Muscholl},
  title     = {A Tight Lower Bound for the Capture Time of the Cops and Robbers Game},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {80},
  pages     = {82:1--82:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.82},
  doi       = {10.4230/LIPIcs.ICALP.2017.82},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/BrandtEUW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0