What is it about?
An efficient algorithm to find dense clusters in large real-world graphs, and cover most of the graph with such clusters.
Featured Image
Why is it important?
Improves upon the performance of existing techniques while being faster than almost every comparable benchmark.
Read the Original
This page is a summary of: Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets, October 2024, ACM (Association for Computing Machinery),
DOI: 10.1145/3627673.3679578.
You can read the full text:
Contributors
The following have contributed to this page
