Co-occurring keywords · papers mentioning both
Papers
Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs
ICML 2024
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
ICML 2024
Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining
AAAI 2024
Differentially Private Densest Subgraph
AISTATS 2022
Faster and Scalable Algorithms for Densest Subgraph and Decomposition
NeurIPS 2022
Differentially Private Densest Subgraph Detection
ICML 2021
Faster width-dependent algorithm for mixed packing and covering LPs
NeurIPS 2019
Improved Parallel Algorithms for Density-Based Network Clustering
ICML 2019