Yixiang Fang, Kaiqiang Yu, Reynold Cheng +2
The paper introduces a new approach for finding densest subgraphs by leveraging k‑core structures, providing exact and approximate algorithms that work for various density definiti…