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 following new improved upper and lower bounds:
No takes yet. Share an insight, caveat, or question.
Dalirrooyfard et al. (2019) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: