Co-occurring keywords · papers mentioning both
Papers
A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds
AAAI 2026
Densest k-Subgraph Mining via a Provably Tight Relaxation
AAAI 2025
Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time
AAAI 2025
Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining
AAAI 2024
Online Dense Subgraph Discovery via Blurred-Graph Feedback
ICML 2020
TellTail: Fast Scoring and Detection of Dense Subgraphs
AAAI 2020
Community Focusing: Yet Another Query-Dependent Community Detection
AAAI 2019
Fast Algorithm for K-Truss Discovery on Public-Private Graphs
IJCAI 2019
Multi-Prototype Networks for Unconstrained Set-based Face Recognition
IJCAI 2019
Finding Dense Subgraphs via Low-Rank Bilinear Optimization
ICML 2014
The Lovász ϑ function, SVMs and finding large dense subgraphs
NeurIPS 2012