Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

We consider the pattern detection problem in graphs: given a constant size pattern graph $H$ and a host graph $G$, determine whether $G$ contains a subgraph isomorphic to $H$. We present the follow...