Listing k-cliques in Sparse Real-World Graphs*-Reference-Cited by-同舟云学术

Listing k-cliques in Sparse Real-World Graphs*

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18
language:
Short-container-title:

Author:

Danisch Maximilien¹,Balalau Oana²,Sozio Mauro³

Affiliation:

1. Sorbonne Université, CNRS, LIP6, Paris, France

2. Max Planck Institute for Informatics, Saarbrücken, Germany

3. LTCI, Télécom ParisTech University, Paris, France

Funder

Google

French National Agency of Research

European Commission

Ile-de-France Region

Publisher

ACM Press

Reference53 articles.

1. [n. d.]. http://research.nii.ac.jp/~uno/codes.htm. ([n. d.]).

2. Nesreen K Ahmed, Jennifer Neville, Ryan A Rossi, and Nick Duffield. 2015. Efficient graphlet counting for large networks. In Data Mining (ICDM), 2015 IEEE International Conference on. IEEE, 1--10.

3. Noga Alon, Raphael Yuster, and Uri Zwick. 1995. Color-coding. J. ACM 42, 4 (July 1995), 844--856. https://doi.org/10.1145/210332.210337

4. Noga Alon, Raphael Yuster, and Uri Zwick. 1997. Finding and counting given length cycles. Algorithmica 17, 3 (1997), 209--223.

5. Albert Angel, Nick Koudas, Nikos Sarkas, Divesh Srivastava, Michael Svendsen, and Srikanta Tirthapura. 2014. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J. 23, 2 (2014), 175--199.

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

1. BDAC: Boundary-Driven Approximations of K-Cliques;Symmetry;2024-08-02

2. Maximal size constraint community search over bipartite graphs;Knowledge-Based Systems;2024-08

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

4. Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks;Proceedings of the VLDB Endowment;2024-07

5. Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs;Proceedings of the VLDB Endowment;2024-07