Efficient (α, β)-core Computation: an Index-based Approach-Reference-Cited by-同舟云学术

Efficient (α, β)-core Computation: an Index-based Approach

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:The World Wide Web Conference on - WWW '19
language:
Short-container-title:

Author:

Liu Boge¹,Yuan Long²,Lin Xuemin¹,Qin Lu³,Zhang Wenjie¹,Zhou Jingren⁴

Affiliation:

1. The University of New South Wales, Australia

2. Nanjing University of Science and Technology, China

3. Centre for Artificial Intelligence, University of Technology, Sydney, Australia, Australia

4. Alibaba Group, China

Publisher

ACM Press

Reference54 articles.

1. Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-Hee Hong, Damian Merrick, and Andrej Mrvar. 2007. Visualisation and analysis of the Internet movie database. In Visualization, 2007. APVIS'07. 2007 6th International Asia-Pacific Symposium on. IEEE, 17-24.

2. Mohammad Allahbakhsh, Aleksandar Ignjatovic, Boualem Benatallah, Seyed-Mehdi-Reza Beheshti, Elisa Bertino, and Norman Foo. 2013. Collusion Detection in Online Rating Systems. In Web Technologies and Applications, Yoshiharu Ishikawa, Jianzhong Li, Wei Wang, Rui Zhang, and Wenjie Zhang (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 196-207.

3. Jose´ Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2005. k-core decomposition: A tool for the visualization of large scale networks. arXiv preprint cs/0504107(2005).

4. Sihem Amer-Yahia, Senjuti Basu Roy, Ashish Chawlat, Gautam Das, and Cong Yu. 2009. Group Recommendation: Semantics and Efficiency. Proc. VLDB Endow. 2, 1 (Aug. 2009), 754-765. https://doi.org/10.14778/1687627.1687713

5. Gary D Bader and Christopher WV Hogue. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC bioinformatics 4, 1 (2003), 2.

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

1. Label-constrained shortest path query processing on road networks;The VLDB Journal;2023-12-16

2. Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks;Proceedings of the ACM on Management of Data;2023-12-08

3. Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs;IEEE Transactions on Knowledge and Data Engineering;2023-12-01

4. Practical and Malicious Multiparty Private Set Intersection for Small Sets;Electronics;2023-11-30

5. Efficient Core Maintenance in Large Bipartite Graphs;Proceedings of the ACM on Management of Data;2023-11-13