A survey on the densest subgraph problem and its variants
The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …
whose induced subgraph maximizes a measure of density. The problem has received a …
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
The densest subgraph problem has received significant attention, both in theory and in
practice, due to its applications in problems such as community detection, social network …
practice, due to its applications in problems such as community detection, social network …
A survey of densest subgraph discovery on large graphs
With the prevalence of graphs for modeling complex relationships among objects, the topic
of graph mining has attracted a great deal of attention from both academic and industrial …
of graph mining has attracted a great deal of attention from both academic and industrial …
On the generalized mean densest subgraph problem: complexity and algorithms
Dense subgraph discovery is an important problem in graph mining and network analysis
with several applications. Two canonical problems here are to find a maxcore (subgraph of …
with several applications. Two canonical problems here are to find a maxcore (subgraph of …
Densest subhypergraph: Negative supermodular functions and strongly localized methods
Dense subgraph discovery is a fundamental primitive in graph and hypergraph analysis
which among other applications has been used for real-time story detection on social media …
which among other applications has been used for real-time story detection on social media …
Convergence to lexicographically optimal base in a (contra) polymatroid and applications to densest subgraph and tree packing
Boob et al.[1] described an iterative peeling algorithm called Greedy++ for the Densest
Subgraph Problem (DSG) and conjectured that it converges to an optimum solution …
Subgraph Problem (DSG) and conjectured that it converges to an optimum solution …
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs
Locally-densest subgraph (LDS) decomposition is a fundamental decomposition in graph
analysis that finds numerous applications in various domains, including community …
analysis that finds numerous applications in various domains, including community …
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
Densest subgraph discovery (DSD) is a fundamental topic in graph mining. It has been
extensively studied in the literature and has found many real applications in a wide range of …
extensively studied in the literature and has found many real applications in a wide range of …
Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach
The quest to identify local dense communities closely connected to predetermined seed
nodes is vital across numerous applications. Given the seed nodes R, the R-subgraph …
nodes is vital across numerous applications. Given the seed nodes R, the R-subgraph …
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a
wide spectrum of real applications. Several DSD algorithms, including exact and …
wide spectrum of real applications. Several DSD algorithms, including exact and …