• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Norges Handelshøyskole
  • Department of Business and Management Science
  • Discussion papers (FOR)
  • View Item
  •   Home
  • Norges Handelshøyskole
  • Department of Business and Management Science
  • Discussion papers (FOR)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The analysis of split graphs in social networks based on the K-Cardinality assignment problem

Belik, Ivan
Working paper
Thumbnail
View/Open
0814.pdf (487.4Kb)
URI
http://hdl.handle.net/11250/194969
Date
2014-02
Metadata
Show full item record
Collections
  • Discussion papers (FOR) [509]
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 kcardinality

assignment problem, we show the way of minimizing the socially risky interactions

between the cliques and the independent sets within the social network.
Publisher
FOR
Series
Discussion paper;08/14

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit