Fast best-effort pattern matching in large attributed graphs
Hanghang Tong, Christos Faloutsos, Brian J. Gallagher, Tina Eliassi‐Rad · 2007
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 query pattern. For example, a "star" query would be, "find a CEO who has strong interactions with a Manager, a Lawyer,and an Accountant, or another structure as close to that as possible". Similarly, a "loop" query could help spot a money laundering ring.