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 …

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 …

This study considers a class of critical node detection problems that involves minimization of
a distance‐based connectivity measure of a given unweighted graph via the removal of a …

The k-core of a graph is defined as the maximal subgraph in which every vertex is
connected to at least k other vertices within that subgraph. In this work we introduce 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 …

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 …

The growing accessibility of large-scale protein interaction data demands extensive
research to understand cell organization and its functioning at the network level …

This chapter aims to provide a detailed survey of existing graph models and algorithms for
important problems that arise in different areas of wireless telecommunication. In particular …

Network robustness issues are crucial in a variety of application areas. In many situations,
one of the key robustness requirements is the connectivity between each pair of nodes …

Given a simple undirected graph, the problem of finding a maximum subset of vertices
satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is …