1 paper · 1 filter
Giovanni Micale, Vincenzo Bonnici, Alfredo Ferro +3
The Subgraph Matching (SM) problem consists of finding all the embeddings of a given small graph, called the query, into a large graph, called the target. The SM problem has been w…