Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

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 …

This paper studies k-plexes, a well known pseudo-clique model for network communities. In
a k-plex, each node can miss at most k-1 links. Our goal is to detect large communities in …

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 …

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 …

Abstract The Maximum k-Defective Clique Problem (MDCP), as a clique relaxation model,
has been used to solve various problems. Because it is a hard computational task, previous …

The problem of enumerating all maximal cliques in a graph is a key primitive in a variety of
real-world applications such as community detection and so on. However, in practice …

A k-plex of a graph G is an induced subgraph in which every vertex has at most k-1
nonadjacent vertices. The Maximum k-plex Problem (MKP) consists in finding ak-plex of the …

As a typical most-to-most connected quasi-biclique model, k-biplex is a superset of
bicliques, which allows nodes on each side of a fully connected subgraph to lose at most k …

The maximum k-plex, a generalization of maximum clique, is used to cope with a great
number of real-world problems. The aim of this paper is to propose a novel exact k-plex …