Author:
Braverman Vladimir,Ostrovsky Rafail,Vilenchik Dan
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the 28th STOC, pp. 20–29 (1996)
2. Alon, M., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17, 209–223 (1997)
3. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th SODA, pp. 623–632 (2002)
4. Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceeding of the 14th ACM International Conference on Knowledge Discovery and Data Mining, pp. 16–24 (2008)
5. Buriol, L., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: Proceedings of the Twenty-Fifth ACM Symposium on Principles of database Systems, pp. 253–262 (2006)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Auxo: A Scalable and Efficient Graph Stream Summarization Structure;Proceedings of the VLDB Endowment;2023-02
3. Motif Cut Sparsifiers;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. HTC: Hybrid vertex-parallel and edge-parallel Triangle Counting;2022 IEEE High Performance Extreme Computing Conference (HPEC);2022-09-19
5. Approximately Counting Subgraphs in Data Streams;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12