Author:
Agostini Matteo,Bressan Marco,Haddadan Shahrzad
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, A. Panconesi, Counting graphlets: space vs time, in: ACM WSDM 2017, pp. 557–566.
2. Motif counting beyond five nodes;Bressan;ACM Trans. Knowl. Discov. Data,2018
3. MOTIVO: fast motif counting via succinct color coding and adaptive sampling;Bressan;Proc. VLDB Endow.,2019
4. M.A. Bhuiyan, M. Rahman, M. Rahman, M. Al Hasan, GUISE: uniform sampling of graphlets for large graph analysis, in: IEEE ICDM 2012, pp. 91–100.
5. Efficiently estimating motif statistics of large networks;Wang;ACM Trans. Knowl. Discov. Data,2014
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fast and Perfect Sampling of Subgraphs and Polymer Systems;ACM Transactions on Algorithms;2024-01-22
2. Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs;ACM Transactions on Algorithms;2023-06-24
3. DeMEtRIS: Counting (near)-Cliques by Crawling;Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining;2023-02-27
4. Efficient and near-optimal algorithms for sampling connected subgraphs;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Faster Motif Counting via Succinct Color Coding and Adaptive Sampling;ACM Transactions on Knowledge Discovery from Data;2021-05-19