With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

The k-plex model is a relaxation of the clique model by allowing every vertex to miss up to k
neighbors. Designing exact and efficient algorithms for computing a maximum k-plex in a …

Recently, the topic of truss computation has gained plenty of attention, where the k-truss of a
graph is the maximum subgraph in which each edge participates in at least (k-2) triangles …

Identifying and extracting user communities is an important step towards understanding
social network dynamics from a macro perspective. For this reason, the work in this paper …

Quasi-cliques are a type of dense subgraphs that generalize the notion of cliques, important
for applications such as community/module detection in various social and biological …

In a graph, a k-plex is a vertex set in which every vertex is not adjacent to at most k vertices
of this set. The maximum k-plex problem, which asks for the largest k-plex from the given …

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 …

Recent superscalar processors issue four instructions per cycle. These processors are also
powered by highly-parallel superscalar cores. The potential performance can only be …

Listing dense subgraphs in large graphs plays a key task in varieties of network analysis
applications like community detection. Clique, as the densest model, has been widely …

Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely
studied. One important cohesive structure on bipartite graphs is k-biplex, where each vertex …