5 papers
BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
Mohammad Matin Najafi, Xianju Zhu, Chrysanthi Kosyfaki +2
Subgraph counting the task of determining the number of instances of a query pattern within a large graph lies at the heart of many critical applications, from analyzing financial…
Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
Yi Yang, Chenhao Ma, Reynold Cheng +2
Finding the densest subgraph (DS) from a graph is a fundamental problem in graph databases. The DS obtained, which reveals closely related entities, has been found to be useful in…
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
Kaiqiang Yu, Kaixin Wang, Cheng Long +2
Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between…
On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
Carrie Wang, Sihem Amer-Yahia, Laks V. S. Lakshmanan +1
We study Aggregation Queries over Nearest Neighbors (AQNN), which compute aggregates over the learned representations of the neighborhood of a designated query object. For example,…
Multi-order Graph Clustering with Adaptive Node-level Weight Learning
Ye Liu, Xuelei Lin, Yejia Chen +1
Current graph clustering methods emphasize individual node and edge con nections, while ignoring higher-order organization at the level of motif. Re cently, higher-order graph clus…