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 …
Scalable motif-aware graph clustering
We develop new methods based on graph motifs for graph clustering, allowing more
efficient detection of communities within networks. We focus on triangles within graphs, but …
efficient detection of communities within networks. We focus on triangles within graphs, but …
Listing k-cliques in sparse real-world graphs
Motivated by recent studies in the data mining community which require to efficiently list all k-
cliques, we revisit the iconic algorithm of Chiba and Nishizeki and develop the most efficient …
cliques, we revisit the iconic algorithm of Chiba and Nishizeki and develop the most efficient …
Antibenford subgraphs: Unsupervised anomaly detection in financial networks
Benford's law describes the distribution of the first digit of numbers appearing in a wide
variety of numerical data, including tax records, and election outcomes, and has been used …
variety of numerical data, including tax records, and election outcomes, and has been used …
Efficient algorithms for densest subgraph discovery
Densest subgraph discovery (DSD) is a fundamental problem in graph mining. It has been
studied for decades, and is widely used in various areas, including network science …
studied for decades, and is widely used in various areas, including network science …
Densest subgraph: Supermodularity, iterative peeling, and flow
The densest subgraph problem in a graph (DSG), in the simplest form, is the following.
Given an undirected graph G=(V, E) find a subset S⊆ V of vertices that maximizes the ratio …
Given an undirected graph G=(V, E) find a subset S⊆ V of vertices that maximizes the ratio …
Efficient bitruss decomposition for large-scale bipartite graphs
Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently.
An important structure k-bitruss is the maximal cohesive subgraph where each edge is …
An important structure k-bitruss is the maximal cohesive subgraph where each edge is …
Pangolin: An efficient and flexible graph mining system on cpu and gpu
There is growing interest in graph pattern mining (GPM) problems such as motif counting.
GPM systems have been developed to provide unified interfaces for programming …
GPM systems have been developed to provide unified interfaces for programming …
Efficient algorithms for densest subgraph discovery on large directed graphs
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
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 …