Finding large balanced subgraphs in signed networks

Ordozgoiti Bruno
Ordozgoiti Bruno
Matakos Antonis
Matakos Antonis

WWW '20: The Web Conference 2020 Taipei Taiwan April, 2020, pp. 1378-1388, 2020.

Cited by: 0|Bibtex|Views13|DOI:https://doi.org/10.1145/3366423.3380212
EI
Other Links: arxiv.org|dl.acm.org|academic.microsoft.com|dblp.uni-trier.de

Abstract:

Signed networks are graphs whose edges are labelled with either a positive or a negative sign, and can be used to capture nuances in interactions that are missed by their unsigned counterparts. The concept of balance in signed graph theory determines whether a network can be partitioned into two perfectly opposing subsets, and is therefor...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments