The paper addresses the well-known cluster edge editing problem. A literature survey of
various cluster editing problems and corresponding solving approaches are presented …

Abstract In the Cluster Editing problem, a given graph is to be transformed into a disjoint
union of cliques via a minimum number of edge editing operations. In this paper we …

Recent years have witnessed the great success of graph neural networks (GNNs) in various
graph data mining tasks. However, studies demonstrate that GNNs are vulnerable to …

Multiple interval graphs are a well-known generalization of interval graphs, where each
vertex of a graph is represented by a d-interval (the union of d intervals) for some natural …

Clustering a graph when the clusters can overlap can be seen from three different angles:
We may look for cliques that cover the edges of the graph with bounded overlap, we may …

Correlation clustering seeks a partition of the vertex set of a given graph/network into groups
of closely related, or just close enough, vertices so that elements of different groups are not …

Vertex splitting is a graph operation that replaces a vertex $ v $ with two nonadjacent new
vertices and makes each neighbor of $ v $ adjacent with one or both of the introduced …

In the Cluster Editing problem, sometimes known as (unweighted) Correlation Clustering,
we must insert and delete a minimum number of edges to achieve a graph in which every …

We explore Cluster Editing and its generalization Correlation Clustering with a new
operation called permissive vertex splitting which addresses finding overlapping clusters in …

The article addresses applications of combinatorial clustering engineering approach in
communication networks including design of layered network architecture, routing …