Scalable Fine-Grained Parallel Cycle Enumeration Algorithms-Reference-Cited by-同舟云学术

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Blanusa Jovan¹,Ienne Paolo²,Atasu Kubilay³

Affiliation:

1. IBM Research Europe & Ecole Polytechnique Fédérale de Lausanne (EPFL), Zurich, Switzerland

2. Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland

3. IBM Research Europe, Zurich, Switzerland

Funder

Swiss National Science Foundation

Publisher

ACM

Link

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

Reference68 articles.

1. ScaleMine: Scalable Parallel Frequent Subgraph Mining in a Single Large Graph

2. Charu C. Aggarwal and Haixun Wang (Eds.) . 2010 . Managing and Mining Graph Data. Advances in Database Systems, Vol. 40 . Springer US , Boston, MA. doi: 10.1007/978--1--4419--6045-0. 10.1007/978--1--4419--6045-0 Charu C. Aggarwal and Haixun Wang (Eds.). 2010. Managing and Mining Graph Data. Advances in Database Systems, Vol. 40. Springer US, Boston, MA. doi: 10.1007/978--1--4419--6045-0.

3. Erik Altman. 2021. AML-Data. Available online: https://github.com/IBM/AMLData. Accessed: 2022-05--30. Erik Altman. 2021. AML-Data. Available online: https://github.com/IBM/AMLData. Accessed: 2022-05--30.

4. Albert-László Barabási and Márton Pósfai . 2016. Network science . Cambridge University Press , Cambridge, United Kingdom, Chapter The scale-free property, 1--57. Albert-László Barabási and Márton Pósfai. 2016. Network science. Cambridge University Press, Cambridge, United Kingdom, Chapter The scale-free property, 1--57.

5. Optimal Listing of Cycles and st-Paths in Undirected Graphs

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

1. HardCilk: Cilk-like Task Parallelism for FPGAs;2024 IEEE 32nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM);2024-05-05

2. Enumerating all multi-constrained s–t paths on temporal graph;Knowledge and Information Systems;2023-09-27

3. Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles;ACM Transactions on Parallel Computing;2023-09-21