Mining large quasi-cliques with quality guarantees from vertex neighborhoods
A Konar, ND Sidiropoulos - Proceedings of the 26th ACM SIGKDD …, 2020 - dl.acm.org
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks.
In this work, we formally establish that two recurring characteristics of real-world graphs …
In this work, we formally establish that two recurring characteristics of real-world graphs …
Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods
A Konar, ND Sidiropoulos - arXiv preprint arXiv:2008.07996, 2020 - arxiv.org
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks.
In this work, we formally establish that two recurring characteristics of real-world graphs …
In this work, we formally establish that two recurring characteristics of real-world graphs …
[PDF][PDF] Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods
A Konar, ND Sidiropoulos - ACM KDD'20, August 23–27, 2020, 2020 - par.nsf.gov
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks.
In this work, we formally establish that two recurring characteristics of real-world graphs …
In this work, we formally establish that two recurring characteristics of real-world graphs …
Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods
A Konar, ND Sidiropoulos - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks.
In this work, we formally establish that two recurring characteristics of real-world graphs …
In this work, we formally establish that two recurring characteristics of real-world graphs …
[PDF][PDF] Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods
A Konar, ND Sidiropoulos - algorithms, 2020 - aritrakonar.github.io
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks.
In this work, we formally establish that two recurring characteristics of real-world graphs …
In this work, we formally establish that two recurring characteristics of real-world graphs …
Mining Large Quasi-Cliques with Quality Guarantees from Vertex Neighborhoods
A Konar, ND Sidiropoulos - aritrakonar.github.io
Mining Large Quasi-Cliques with Quality Guarantees from Vertex Neighborhoods Page 1
Mining Large Quasi-Cliques with Quality Guarantees from Vertex Neighborhoods Aritra Konar …
Mining Large Quasi-Cliques with Quality Guarantees from Vertex Neighborhoods Aritra Konar …