Vis enkel innførsel

dc.contributor.authorBelik, Ivan
dc.date.accessioned2014-05-14T06:39:15Z
dc.date.available2014-05-14T06:39:15Z
dc.date.issued2014-02
dc.identifier.issn1500-4066
dc.identifier.urihttp://hdl.handle.net/11250/194969
dc.description.abstractIn 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 kcardinality assignment problem, we show the way of minimizing the socially risky interactions between the cliques and the independent sets within the social network.nb_NO
dc.language.isoengnb_NO
dc.publisherFORnb_NO
dc.relation.ispartofseriesDiscussion paper;08/14
dc.subjectVDP::Samfunnsvitenskap: 200::Økonomi: 210::Samfunnsøkonomi: 212nb_NO
dc.subjectsocial networksnb_NO
dc.subjectsplit graphsnb_NO
dc.subjectk-cardinality assignmentnb_NO
dc.titleThe analysis of split graphs in social networks based on the K-Cardinality assignment problemnb_NO
dc.typeWorking papernb_NO


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel