2 citations · 3 across the 3 of their papers we have counts for
3 papers
MultiGraphMatch: a subgraph matching algorithm for multigraphs
Giovanni Micale, Antonio Di Maria, Roberto Grasso +5
Subgraph matching is the problem of finding all the occurrences of a small graph, called the query, in a larger graph, called the target. Although the problem has been widely studi…
Mining Frequent Structures in Conceptual Models
Mattia Fumagalli, Tiago Prince Sales, Pedro Paulo F. Barcelos +6
The problem of using structured methods to represent knowledge is well-known in conceptual modeling and has been studied for many years. It has been proven that adopting modeling p…
MultiRI: Fast Subgraph Matching in Labeled Multigraphs
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…