Revisiting Wedge Sampling for Triangle Counting-Reference-Cited by-同舟云学术

Revisiting Wedge Sampling for Triangle Counting

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

Author:

Turk Ata¹,Turkoglu Duru²

Affiliation:

1. Boston University, USA

2. Loyola University, USA

Publisher

ACM Press

Reference40 articles.

1. Nesreen K Ahmed, Nick Duffield, Theodore L Willke, and Ryan A Rossi. 2017. On sampling from massive graph streams. Proceedings of the VLDB Endowment10, 11 (2017), 1430-1441.

2. Yazan Alaya AL-Khassawneh, Naomie Salim, and Obasa Adekunle Isiaka. 2014. Extractive Text Summarisation using Graph Triangle Counting Approach: Proposed Method. In 1 st International Conference of Recent Trends in Information and Communication Technologies in Universiti Teknologi Malaysia, Johor, Malaysia. 300-311.

3. N. Alon, R. Yuster, and U. Zwick. 1997. Finding and counting given length cycles. Algorithmica17, 3 (01 Mar 1997), 209-223.

4. A. Azad, A. Buluç, and J. Gilbert. 2015. Parallel Triangle Counting and Enumeration Using Matrix Algebra. In 2015 IEEE International Parallel and Distributed Processing Symposium Workshop. 804-811.

5. Grey Ballard, Tamara G Kolda, Ali Pinar, and C Seshadhri. 2015. Diamond sampling for approximate maximum all-pairs dot-product (MAD) search. In Data Mining (ICDM), 2015 IEEE International Conference on. IEEE, 11-20.

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

1. Global triangle estimation based on first edge sampling in large graph streams;The Journal of Supercomputing;2023-04-03

2. Scalable Motif Counting for Large-scale Temporal Graphs;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05

3. Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering;Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining;2021-08-14

4. CIC-PIM: Trading spare computing power for memory space in graph processing;Journal of Parallel and Distributed Computing;2021-01

5. Efficient Sampling Algorithms for Approximate Temporal Motif Counting;Proceedings of the 29th ACM International Conference on Information & Knowledge Management;2020-10-19