Discussion Papers, Department of Business and Management Science, Norwegian School of Economics (NHH)
The Analysis of Split Graphs in Social Networks Based on the K-Cardinality Assignment Problem
Abstract: In terms of social networks, split graphs correspond to
the variety of interpersonal and intergroup relations. In this paper we
analyse the interaction between the cliques (socially strong and trusty
groups) and the independent sets (fragmented and non-connected groups of
people) as the basic components of any split graph. Based on the
Semi-Lagrangean relaxation for the k-cardinality assignment problem, we
show the way of minimizing the socially risky interactions between the
cliques and the independent sets within the social network.
Keywords: Social networks; split graphs; k-cardinality assignment; (follow links to similar papers)
JEL-Codes: C00; C60; C61; (follow links to similar papers)
12 pages, February 28, 2014
Before downloading any of the electronic versions below
you should read our statement on
for viewing Postscript files and the
Acrobat Reader for viewing and printing pdf files.
Full text versions of the paper:
Questions (including download problems) about the papers in this series should be directed to Stein Fossen ()
Report other problems with accessing this service to Sune Karlsson ()
or Helena Lundin ().
Design by Joachim Ekebom