Anchored coreness: efficient reinforcement of social networks-Reference-Cited by-同舟云学术

Anchored coreness: efficient reinforcement of social networks

Published:2021-05-31 Issue: Volume: Page:
ISSN:1066-8888
Container-title:The VLDB Journal
language:en
Short-container-title:The VLDB Journal

Author:

Linghu Qingyuan,Zhang Fan^ORCID,Lin Xuemin,Zhang Wenjie,Zhang Ying

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems

Link

https://link.springer.com/content/pdf/10.1007/s00778-021-00673-6.pdf

Reference72 articles.

1. MPICH. https://www.mpich.org/

2. OpenMP. https://www.openmp.org/

3. Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: LATIN, pp. 598–612 (2002)

4. Aksu, H., Canim, M., Chang, Y., Korpeoglu, I., Ulusoy, Ö.: Distributed $$k$$ -core view materialization and maintenance for large dynamic graphs. IEEE Trans. Knowl. Data Eng. 26(10), 2439–2452 (2014)

5. Alvarez-Hamelin, J.I., Dall’Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NeurIPS, pp. 41–50 (2005)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the non-submodular network collapse problems via Decision Transformer;Neural Networks;2024-08

2. Targeted k-node collapse problem: Towards understanding the robustness of local k-core structure;Physica A: Statistical Mechanics and its Applications;2024-05

3. On Improving the Cohesiveness of Graphs by Merging Nodes: Formulation, Analysis, and Algorithms;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04

4. Quantifying Node Importance over Network Structural Stability;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04