Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
We study the classic problem of subgraph counting, where we wish to determine the number of occurrences of a fixed pattern graph $H$ in an input graph $G$ of $n$ vertices. Our focus is on \emph{bounded degeneracy} inputs, a rich class of graphs that also characterizes real-world massive networks. Building …