49 citations · 193 across the 39 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019★ 5 cited
Equivalences between triangle and range query problems
Lech Duraj, Krzysztof Kleiner, Adam Polak +1
We define a natural class of range query problems, and prove that all problems within this class have the same time complexity (up to polylogarithmic factors). The equivalence is v…
cs.CC2019
Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles
Mina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams
We consider the pattern detection problem in graphs: given a constant size pattern graph and a host graph , determine whether contains a subgraph isomorphic to . Our…