Mina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams. Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 1167-1178, ACM, 2019. [doi]
@inproceedings{DalirrooyfardVW19,
title = {Graph pattern detection: hardness for all induced patterns and faster non-induced cycles},
author = {Mina Dalirrooyfard and Thuy Duong Vuong and Virginia Vassilevska Williams},
year = {2019},
doi = {10.1145/3313276.3316329},
url = {https://doi.org/10.1145/3313276.3316329},
researchr = {https://researchr.org/publication/DalirrooyfardVW19},
cites = {0},
citedby = {0},
pages = {1167-1178},
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019},
editor = {Moses Charikar and Edith Cohen},
publisher = {ACM},
isbn = {978-1-4503-6705-9},
}