1 paper
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…