The Complexity of Counting Cycles in the Adjacency List Streaming Model-Reference-Cited by-同舟云学术

The Complexity of Counting Cycles in the Adjacency List Streaming Model

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19
language:
Short-container-title:

Author:

Kallaugher John¹,McGregor Andrew²,Price Eric¹,Vorotnikova Sofya²

Affiliation:

1. University of Texas at Austin, Austin, TX, USA

2. University of Massachusetts Amherst, Amherst, MA, USA

Funder

Simons Foundation

Publisher

ACM Press

Reference34 articles.

1. Lars Arge, Michael T. Goodrich, and Nodari Sitchinava. 2010. Parallel external memory graph algorithms. In 24th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010, Atlanta, Georgia, USA, 19--23 April 2010 - Conference Proceedings. 1--11. https://doi.org/10.1109/IPDPS.2010.5470440

2. Shaikh Arifuzzaman, Maleq Khan, and Madhav V. Marathe. 2013. PATRIC: a parallel algorithm for counting triangles in massive networks. In 22nd ACMInternational Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013. 529--538. https://doi.org/10.1145/2505515.2505545

3. Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6--8, 2002, San Francisco, CA, USA. 623-- 632. http://dl.acm.org/citation.cfm?id=545381.545464

4. Luca Becchetti, Paolo Boldi, Carlos Castillo, and Aristides Gionis. 2008. Efficient Semi-streaming Algorithms for Local Triangle Counting in Massive Graphs. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '08). ACM, New York, NY, USA, 16--24. https://doi.org/10.1145/1401890.1401898

5. Suman K. Bera and Amit Chakrabarti. 2017. Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Heribert Vollmer and Brigitte Vallée (Eds.), Vol. 66. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 11:1-- 11:14. https://doi.org/10.4230/LIPIcs.STACS.2017.11

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

1. Structured encryption for triangle counting on graph data;Future Generation Computer Systems;2023-08

2. Hierarchical data structures for flowchart;Scientific Reports;2023-04-09

3. Differentially Private Triangle and 4-Cycle Counting in the Shuffle Model;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07

4. Approximately Counting Subgraphs in Data Streams;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12

5. Edge sampling and graph parameter estimation via vertex neighborhood accesses;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09