Prefer a chat interface with context about you and your work?
Faster algorithms for counting subgraphs in sparse graphs
Given a k-node pattern graph H and an n-node host graph G, the subgraph counting problem asks to compute the number of copies of H in G. In this work we address the following question: can we count the copies of H faster if G is sparse? We answer in …