30 citations · 41 across the 19 of their papers we have counts for
1 paper · 2 filters
Arpan Kusari, Wenbo Sun
Subgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge w…