SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization.

@inproceedings{niu-2025-sans, author = {Yudong Niu and Yuchen Li and Jiaxin Jiang and Laks V. S. Lakshmanan}, editor = {Guodong Long and Michale Blumestein and Yi Chang and Liane Lewin-Eytan and Zi Huang and Elad Yom-Tov}, title = {{SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization}}, booktitle = {{Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025}}, pages = {4250--4263}, publisher = {ACM}, year = {2025}, url = {https://doi.org/10.1145/3696410.3714603}, doi = {https://doi.org/10.1145/3696410.3714603} }