For more than a decade, graphs have been used to model the voting behavior taking place
in parliaments. However, the methods described in the literature suffer from several …

In this work, we study graph clustering problems associated with structural balance. One of
these problems is known in computer science literature as the correlation-clustering (CC) …

Abstract The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a
subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set …

In order to study real-world systems, many applied works model them through signed
graphs, that is, graphs whose edges are labelled as either positive or negative. Such a …

This article provides an overview about the main results and findings developed in the
dissertation of the author [8]. In this thesis, we develop methods in mathematical optimization …

We are interested in the solution of the maximum k-balanced subgraph problem. Let G=(V,
E, s) be a signed graph and ka positive scalar. A signed graph is k-balanced if V can be …

A signed graph, ie, an undirected graph whose edges have labels in {− 1,+ 1}, is balanced if
it has no negative cycles. Given a signed graph, we are interested in a balanced induced …

The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of
a signed graph that is balanced and maximizes the cardinality of its vertex set. We are …

In the context of community detection, correlation clustering (CC) provides a measure of
balance for social networks as well as a tool to explore their structures. However, CC does …