83 citations · 133 across the 14 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 3 cited
DeMEtRIS: Counting (near)-Cliques by Crawling
Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan +1
We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available through crawling its vertices; thus typically se…
cs.LG2022★ 2 cited
Improved Approximation for Fair Correlation Clustering
Sara Ahmadian, Maryam Negahbani
Correlation clustering is a ubiquitous paradigm in unsupervised machine learning where addressing unfairness is a major challenge. Motivated by this, we study Fair Correlation Clus…