With the rapid development of science and technology, the world is becoming increasingly
connected. The following dire need for understanding both the relationships amongst …

The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

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 …

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 …

With the ongoing debate on'freedom of speech'vs.'hate speech,'there is an urgent need to
carefully understand the consequences of the inevitable culmination of the two, ie,'freedom …

Existing graph-processing frameworks let users develop efficient implementations for many
graph problems, but none of them support efficiently bucketing vertices, which is needed for …

WhatsApp is the most popular messaging app in the world. Due to its popularity, WhatsApp
has become a powerful and cheap tool for political campaigning being widely used during …

We study the densest subgraph problem (DSG) and the densest subgraph local
decomposition problem (DSG-LD) in undirected graphs. We also consider supermodular …

The model of k-core and its decomposition have been applied in various areas, such as
social networks, the world wide web, and biology. A graph can be decomposed into an …

The problem of finding dense components of a graph is a major primitive in graph mining
and data analysis. The densest subgraph problem (DSP) that asks to find a subgraph with …