Liu, Ya, et al. “A Scalable and Exact Relaxation for Densest K-Subgraph via Error Bounds”. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 40, no. 18, Mar. 2026, pp. 15360-8, doi:10.1609/aaai.v40i18.38562.