Cited By
View all- Zhou YGuo QFang YMa C(2024)A Counting-based Approach for Efficient k-Clique Densest Subgraph DiscoveryProceedings of the ACM on Management of Data10.1145/36549222:3(1-27)Online publication date: 30-May-2024
- Vandierendonck H(2024)Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem SizeProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656607(150-163)Online publication date: 30-May-2024
- Ye XLi RDai QChen HWang G(2024)Efficient -Clique Counting on Large Graphs: The Power of Color-Based Sampling ApproachesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.331464336:4(1518-1536)Online publication date: Apr-2024
- Show More Cited By