2007/08/12 by Hanghang Tong, Christos Faloutsos, Brian Gallagher +1 · 2 citations
Computer Science · #Graph Theory and Algorithms #Peer-to-Peer Network Technologies #Data Management and Algorithms
paper · doi:10.1145/1281192.1281271
openalex publication_date 2007/08/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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.