Showing cs.DBShow all
2 papers · 1 filter
cs.DB2025
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…
cs.DB2025
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…