Fast Best-Effort Pattern Matching in Large Attributed Graphs

We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person’s job title. In such a setting, we want to find subgraphs that match a user