DBScholar

Back to papers

Global Reinforcement of Social Networks: The Anchored Coreness Problem

Summary: Global reinforcement of social networks via anchored coreness: anchor a small vertex set to maximize total coreness gain. NP-hard; introduces pruning-based heuristic that reuses intermediate results, with experiments on real data demonstrating effectiveness and efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6021
Venue
SIGMOD
Year
2020
Pagerank
6.7561061e-05
Overall Rank
4,331 | 70.29%
DOI
10.1145/3318464.3389744

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{linghu_sigmod20,
        title = {{Global Reinforcement of Social Networks: The Anchored Coreness Problem}},
        author = {Linghu, Qingyuan and Zhang, Fan and Lin, Xuemin and Zhang, Wenjie and Zhang, Ying},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3389744},
        url = {https://dl.acm.org/doi/10.1145/3318464.3389744},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers