Who should be invited to my party: A size-constrained k-core problem in social networks
In this paper, we investigate the problem of a size-constrained k-core group query (SCCGQ) in social networks, taking both user closeness and network topology into consideration. More specifically, SCCGQ intends to find a group of h users that has the highest social closeness while being a k-core. S...
Saved in:
Main Authors: | MA, Yu-Liang, YUAN, Ye, ZHU, Feida, WANG, Guo-Ren, XIAO, Jing, WANG, Jian-Zong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4841 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A chance-constrained programming of fourth-party logistics routing problem with fuzzy duration time
by: Cui, Y., et al.
Published: (2014) -
Who should pay the cost: A game-theoretic model for government subsidized investments to improve national cybersecurity
by: WANG, Xinrun, et al.
Published: (2019) -
Who provides liquidity, and when?
by: Li, Sida, et al.
Published: (2022) -
Core determining class and inequality selection
by: LUO, Ye, et al.
Published: (2017) -
Should I cut my bangs?
by: Annabelle, Caitlin
Published: (2024)