Fine-Grained Complexity of Subgraph Isomorphism: Characterizing Patterns with Subquadratic Algorithms

For any pattern graph H, we determine whether it admits subquadratic algorithms for minimum-weight subgraph, subgraph listing, and subgraph enumeration, and if so, we provide the optimal time complexity.