Author:
Chaintreau Augustin,Ducoffe Guillaume,Mazauric Dorian
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. Angel, E., Bampis, E., Kononov, A., Paparas, D., Pountourakis, E., Zissimopoulos, V.: Clustering on k-edge-colored graphs. Discrete Applied Mathematics (2016)
2. Ballester, C.: NP-completeness in hedonic games. Games Econ. Behav. 49(1), 1–30 (2004)
3. Bermond, J.-C., Chaintreau, A., Ducoffe, G., Mazauric, D.: How long does it take for all users in a social network to choose their communities? Discret. Appl. Math. 270, 37–57 (2019)
4. Bondy, J.A., Murty, U.S.R.: Graph theory. Grad. Texts in Math. (2008)
5. Burani, N., Zwicker, W.S.: Coalition formation games with separable preferences. Math. Soc. Sci. 45(1), 27–52 (2003)