Machine Learning
Summarizing Dynamic Bipolar Conflict Structures
IEEE Transactions on Visualization and Computer Graphics
Surfing a Web of Trust: Reputation and Reciprocity on CouchSurfing.com
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04
Signed networks in social media
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Predicting positive and negative links in online social networks
Proceedings of the 19th international conference on World wide web
Sitting closer to friends than enemies, revisited
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs, recent empirical studies have proved that they fail to reflect some current practices in real social networks. In this paper we address the issue of drawing signed graphs and capturing such social interactions. We relax the previous assumptions to define a drawing as a model in which every vertex has to be placed closer to its neighbors connected through a positive edge than its neighbors connected through a negative edge in the resulting space. Based on this definition, we address the problem of deciding whether a given signed graph has a drawing in a given l- dimensional Euclidean space. We focus on the 1-dimensional case, where we provide a polynomial time algorithm that decides if a given complete signed graph has a drawing, and provides it when applicable.