Lightning Fast and Space Efficient k-clique Counting-Reference-Cited by-同舟云学术

Lightning Fast and Space Efficient k-clique Counting

Published:2022-04-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2022
language:
Short-container-title:

Author:

Ye Xiaowei¹,Li Rong-Hua¹,Dai Qiangqiang¹,Chen Hongzhi²,Wang Guoren¹

Affiliation:

1. Beijing Institute of Technology, China

2. ByteDance, China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3485447.3512167

Reference46 articles.

1. Mohammad Almasri Izzat El Hajj Rakesh Nagi Jinjun Xiong and Wen-Mei W. Hwu. 2021. K-Clique Counting on GPUs. CoRR abs/2104.13209(2021). Mohammad Almasri Izzat El Hajj Rakesh Nagi Jinjun Xiong and Wen-Mei W. Hwu. 2021. K-Clique Counting on GPUs. CoRR abs/2104.13209(2021).

2. Noga Alon Raphael Yuster and Uri Zwick. 1994. Color-coding: a new method for finding simple paths cycles and other small subgraphs within large graphs. In STOC. Noga Alon Raphael Yuster and Uri Zwick. 1994. Color-coding: a new method for finding simple paths cycles and other small subgraphs within large graphs. In STOC.

3. Balabhaskar Balasundaram and Sergiy Butenko . 2006. Graph Domination , Coloring and Cliques in Telecommunications . In Handbook of Optimization in Telecommunications . Springer , 865–890. Balabhaskar Balasundaram and Sergiy Butenko. 2006. Graph Domination, Coloring and Cliques in Telecommunications. In Handbook of Optimization in Telecommunications. Springer, 865–890.

4. Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs.DS/0310049(2003). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs.DS/0310049(2003).

5. Luca Becchetti Paolo Boldi Carlos Castillo and Aristides Gionis. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD. Luca Becchetti Paolo Boldi Carlos Castillo and Aristides Gionis. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD.

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

1. Efficient k -Clique Count Estimation with Accuracy Guarantee;Proceedings of the VLDB Endowment;2024-07

2. DeepDense: Enabling node embedding to dense subgraph mining;Expert Systems with Applications;2024-03

3. Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach;Proceedings of the VLDB Endowment;2024-03

4. Triangular Stability Maximization by Influence Spread over Social Networks;Proceedings of the VLDB Endowment;2023-07