Finding and counting patterns in sparse graphs

Abstract

We consider algorithms for finding and counting small, fixed graphs in sparse host graphs. In the non-sparse setting, the parameters treedepth and treewidth play a crucial role in fast, constant-space and polynomial-space algorithms respectively. We discover two new parameters that we call matched treedepth and matched treewidth. We show that, for many patterns, finding and counting patterns with low matched treedepth and low matched treewidth can be done asymptotically faster than the existing algorithms when the host graphs are sparse. As an application to finding and counting fixed-size patterns, we discover $\tilde{O}\left(m^3\right)$-time.¹ constant-space algorithms for graphs on at most 11 edges and $\tilde{O}\left(m^2\right)$-time, polynomial-space algorithms for graphs on at most 9 edges.²