Lower Bounds for Subgraph Detection in the CONGEST Model

Tzlil Gonen, Rotem Oshman. Lower Bounds for Subgraph Detection in the CONGEST Model. In James Aspnes, Alysson Bessani, Pascal Felber, João Leitão 0001, editors, 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017. Volume 95 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{GonenO17,
  title = {Lower Bounds for Subgraph Detection in the CONGEST Model},
  author = {Tzlil Gonen and Rotem Oshman},
  year = {2017},
  doi = {10.4230/LIPIcs.OPODIS.2017.6},
  url = {https://doi.org/10.4230/LIPIcs.OPODIS.2017.6},
  researchr = {https://researchr.org/publication/GonenO17},
  cites = {0},
  citedby = {0},
  booktitle = {21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017},
  editor = {James Aspnes and Alysson Bessani and Pascal Felber and João Leitão 0001},
  volume = {95},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-061-3},
}