The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …

Increasing interest in studying community structures, or clusters in complex networks arising
in various applications has led to a large and diverse body of literature introducing …

Given a simple undirected graph G=(V, E) and a constant γ∈(0, 1), a subset of vertices is
called a γ-quasi-clique or, simply, a γ-clique if it induces a subgraph with the edge density of …

Link prediction is one of the central problems in graph mining. However, recent studies
highlight the importance of higher-order network analysis, where complex structures called …

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 …

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 …

Given a simple graph and a constant γ ∈ (0, 1 γ∈(0, 1, a γ γ-quasi-clique is defined as a
subset of vertices that induces a subgraph with an edge density of at least γ γ. This well …

Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of
cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely …

Given a user-specified minimum degree threshold γ γ, a γ γ-quasi-clique is a subgraph
where each vertex connects to at least γ γ fraction of the other vertices. Quasi-clique is a …

Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of
cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely …