Are unique subgraphs not easier to find?
Consider a pattern graph H with l edges, and a host graph G which may contain several occurrences of H. In [15], we claimed that the time complexity of the problems of finding an occurrence of H (if any) in G as well as that of the decision version of the problem are within a multiplicative factor O˜(l3) of the time complexity for the corresponding problem, where the host graph is guaranteed to co
