The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …

This paper introduces and studies the maximum k-plex problem, which arises in social
network analysis and has wider applicability in several important areas employing graph …

Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has
numerous important applications. Though extensively studied, most existing algorithms …

Maximal clique enumeration is a fundamental problem in graph theory and has been
extensively studied. However, maximal clique enumeration is time-consuming in large …

This paper studies the problem of MCC-Sparse, Maximum Clique Computation over large
real-world graphs that are usually Sparse. In the literature, MCC-Sparse has been studied …

Maximal clique enumeration is a fundamental problem in graph theory and has important
applications in many areas such as social network analysis and bioinformatics. The problem …

Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are
pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a …

Clique relaxation models that were originally introduced in the literature on social network
analysis are not only gaining increasing popularity in a wide spectrum of complex network …

Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has
important applications in many areas such as social network analysis and bioinformatics …

The concept of the clique, originally introduced as a model of a cohesive subgroup in the
context of social network analysis, is a classical model of a cluster in networks. However, the …