Author:
Farouzi Abir,Bellatreche Ladjel,Ordonez Carlos,Pandurangan Gopal,Malki Mimoun
Publisher
Springer International Publishing
Reference29 articles.
1. Afrati, F.N., Sarma, A.D., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a MapReduce computation. PVLDB 6(4), 277–288 (2013)
2. Communications in Computer and Information Science;ST Al-Amin,2018
3. Al Hasan, M., Dave, V.S.: Triangle counting in large networks: a review. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 8(2), e1226 (2018)
4. Arifuzzaman, S., Khan, M., Marathe, M.: A space-efficient parallel algorithm for counting exact triangles in massive networks. In: HPCC, pp. 527–534 (2015)
5. Berry, J.W., Fostvedt, L.A., Nordman, D.J., Phillips, C.A., Seshadhri, C., Wilson, A.G.: Why do simple algorithms for triangle enumeration work in the real world? Internet Math. 11(6), 555–571 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balanced parallel triangle enumeration with an adaptive algorithm;Distributed and Parallel Databases;2023-07-13
2. Parallel Pattern Enumeration in Large Graphs;Lecture Notes in Computer Science;2023
3. Bitwise Algorithms to Compute the Transitive Closure of Graphs in Python;Lecture Notes in Computer Science;2023
4. PandaSQL;Proceedings of the 29th ACM International Conference on Information & Knowledge Management;2020-10-19