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 …
Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs
Differentially private algorithms allow large-scale data analytics while preserving user
privacy. Designing such algorithms for graph data is gaining importance with the growth of …
privacy. Designing such algorithms for graph data is gaining importance with the growth of …
Densest subgraph discovery on large graphs: Applications, challenges, and techniques
As one of the most fundamental problems in graph data mining, the densest subgraph
discovery (DSD) problem has found a broad spectrum of real applications, such as social …
discovery (DSD) problem has found a broad spectrum of real applications, such as social …
Faster and scalable algorithms for densest subgraph and decomposition
We study the densest subgraph problem (DSG) and the densest subgraph local
decomposition problem (DSG-LD) in undirected graphs. We also consider supermodular …
decomposition problem (DSG-LD) in undirected graphs. We also consider supermodular …
Finding locally densest subgraphs: a convex programming approach
Finding the densest subgraph (DS) from a graph is a fundamental problem in graph
databases. The DS obtained, which reveals closely related entities, has been found to be …
databases. The DS obtained, which reveals closely related entities, has been found to be …
Accelerating directed densest subgraph queries with software and hardware approaches
Given a directed graph G, the directed densest subgraph (DDS) problem refers to finding a
subgraph from G, whose density is the highest among all subgraphs of G. The DDS problem …
subgraph from G, whose density is the highest among all subgraphs of G. The DDS problem …
Efficient and effective algorithms for generalized densest subgraph discovery
The densest subgraph problem (DSP) is of great significance due to its wide applications in
different domains. Meanwhile, diverse requirements in various applications lead to different …
different domains. Meanwhile, diverse requirements in various applications lead to different …
Spade: A real-time fraud detection framework on evolving graphs
Real-time fraud detection is a challenge for most financial and electronic commercial
platforms. To identify fraudulent communities, Grab, one of the largest technology …
platforms. To identify fraudulent communities, Grab, one of the largest technology …
Stochastic solutions for dense subgraph discovery in multilayer networks
Y Kawase, A Miyauchi, H Sumita - … Conference on Web Search and Data …, 2023 - dl.acm.org
Network analysis has played a key role in knowledge discovery and data mining. In many
real-world applications in recent years, we are interested in mining multilayer networks …
real-world applications in recent years, we are interested in mining multilayer networks …
Densest diverse subgraphs: How to plan a successful cocktail party with diversity
Dense subgraph discovery methods are routinely used in a variety of applications including
the identification of a team of skilled individuals for collaboration from a social network …
the identification of a team of skilled individuals for collaboration from a social network …