Fast algorithms for determining (generalized) core groups in social networks
Year of publication: |
2011
|
---|---|
Authors: | Batagelj, Vladimir ; Zaveršnik, Matjaž |
Published in: |
Advances in Data Analysis and Classification. - Springer. - Vol. 5.2011, 2, p. 129-145
|
Publisher: |
Springer |
Subject: | Core | Large network | Decomposition | Graph algorithm |
-
Granot, Daniel, (1998)
-
Decomposing a balanced game : a necessary and sufficient condition for the nonemptiness of the core
Abe, Takaaki, (2019)
-
Estimation of social-influence-dependent peer pressure in a large network game
Lin, Zhongjian, (2017)
- More ...
-
Exploratory social network analysis with Pajek
Nooy, Wouter de, (2011)
-
Doreian, Patrick, (2005)
-
Exploratory social network analysis with Pajek
Nooy, Wouter de, (2005)
- More ...