Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri. Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 2315-2332, SIAM, 2021. [doi]

@inproceedings{BeraPS21,
  title = {Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles},
  author = {Suman K. Bera and Noujan Pashanasangi and C. Seshadhri},
  year = {2021},
  doi = {10.1137/1.9781611976465.138},
  url = {https://doi.org/10.1137/1.9781611976465.138},
  researchr = {https://researchr.org/publication/BeraPS21},
  cites = {0},
  citedby = {0},
  pages = {2315-2332},
  booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021},
  editor = {Dániel Marx},
  publisher = {SIAM},
  isbn = {978-1-61197-646-5},
}