Given a graph G and a query node q, community search (CS) aims to find a structurally
cohesive subgraph from G that contains q. CS is widely used in many real-world …

Real-world networks, such as phone-call networks and social networks, are often not static
but temporal. Mining cohesive subgraphs from static graphs is a fundamental task in network …

Local community detection aims to find the communities that a given seed node belongs to.
Most existing works on this problem are based on a very strict assumption that the seed …

Spark has extensively used in many applications of Tencent, due to its easy deployment,
pipeline capability, and close integration with the Hadoop ecosystem. As the graph …

It is more common for multiple users to collaborate to develop a software application in a
P2P collaborative working environment. In collaborative software development, the rational …

Dense subgraph discovery is a fundamental problem in graph mining whose goal is to
extract a dense subgraph from a given graph, and it has a wide range of applications [18] …

The k-core, a kind of structure of graphs, is a maximal connected subgraph with the
minimum degree greater than or equal to k, and has been used in many fields. The …

Clique is one of the most fundamental models for cohesive subgraph mining in network
analysis. Existing clique model mainly focuses on unsigned networks. However, in real …

The rapid development of mobile Internet applications, such as social networks, gives rise to
the high-speed generated complex data, which reflects people's daily production and life …

How can we detect a group of individuals whose connectivity persists and even strengthens
over time? Despite extensive research on temporal networks, this practically pertinent …