Jiaxin Jiang

SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization

2025

How can we efficiently identify the densest subgraph over relational graphs? Existing dense subgraph discovery (DSD) approaches assume that a relational graph H is already derived from a heterogeneous data source and they focus on …