{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T04:55:36Z","timestamp":1783832136131,"version":"3.55.0"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T00:00:00Z","timestamp":1695254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"crossref","award":["172610"],"award-info":[{"award-number":["172610"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in real-world applications, efficient parallel algorithms are required. In this work, we propose scalable parallelisation of state-of-the-art sequential algorithms for enumerating simple, temporal, and hop-constrained cycles. First, we focus on the simple cycle enumeration problem and parallelise the algorithms by Johnson and by Read and Tarjan in a fine-grained manner. We theoretically show that our resulting fine-grained parallel algorithms are scalable, with the fine-grained parallel Read-Tarjan algorithm being strongly scalable. In contrast, we show that straightforward coarse-grained parallel versions of these simple cycle enumeration algorithms that exploit edge- or vertex-level parallelism are not scalable. Next, we adapt our fine-grained approach to enable the enumeration of cycles under time-window, temporal, and hop constraints. Our evaluation on a cluster with 256 CPU cores that can execute up to 1,024 simultaneous threads demonstrates a near-linear scalability of our fine-grained parallel algorithms when enumerating cycles under the aforementioned constraints. On the same cluster, our fine-grained parallel algorithms achieve, on average, one order of magnitude speedup compared to the respective coarse-grained parallel versions of the state-of-the-art algorithms for cycle enumeration. The performance gap between the fine-grained and the coarse-grained parallel algorithms increases as we use more CPU cores.<\/jats:p>","DOI":"10.1145\/3611642","type":"journal-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T09:54:36Z","timestamp":1691142876000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4915-6551","authenticated-orcid":false,"given":"Jovan","family":"Blanu\u0161a","sequence":"first","affiliation":[{"name":"IBM Research Europe-Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4315-6780","authenticated-orcid":false,"given":"Kubilay","family":"Atasu","sequence":"additional","affiliation":[{"name":"IBM Research Europe-Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6142-7345","authenticated-orcid":false,"given":"Paolo","family":"Ienne","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"716","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC\u201916)","author":"Abdelhamid Ehab","year":"2016","unstructured":"Ehab Abdelhamid, Ibrahim Abdelaziz, Panos Kalnis, Zuhair Khayyat, and Fuad Jamour. 2016. ScaleMine: Scalable parallel frequent subgraph mining in a single large graph. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC\u201916). IEEE, 716\u2013727. DOI:10.1109\/SC.2016.60"},{"key":"e_1_3_2_3_2","series-title":"Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC\u201916)","first-page":"8:1\u20138:12","volume":"64","author":"Agarwal Udit","year":"2016","unstructured":"Udit Agarwal and Vijaya Ramachandran. 2016. Finding k simple shortest paths and cycles. In Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC\u201916)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 64), Seok-Hee Hong (Ed.). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 8:1\u20138:12. DOI:10.4230\/LIPIcs.ISAAC.2016.8"},{"key":"e_1_3_2_4_2","series-title":"Advances in Database Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"Aggarwal Charu C.","year":"2010","unstructured":"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"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20290"},{"key":"e_1_3_2_6_2","article-title":"AML-Data","author":"Altman Erik","year":"2021","unstructured":"Erik Altman. 2021. AML-Data. Retrieved from https:\/\/github.com\/IBM\/AML-Data. Accessed: 2022-05-30.","journal-title":"Retrieved from https:\/\/github.com\/IBM\/AML-Data"},{"key":"e_1_3_2_7_2","article-title":"A Practical Parallel Algorithm for Cycle Detection in Partitioned Digraphs","author":"Bader David A.","year":"1999","unstructured":"David A. Bader. 1999. A Practical Parallel Algorithm for Cycle Detection in Partitioned Digraphs. Retrieved from https:\/\/digitalrepository.unm.edu\/ece_rpts\/45","journal-title":"Retrieved from https:\/\/digitalrepository.unm.edu\/ece_rpts\/45"},{"key":"e_1_3_2_8_2","volume-title":"Graph Theory","author":"Balakrishnan V. K.","year":"1997","unstructured":"V. K. Balakrishnan. 1997. Graph Theory. McGraw-Hill Professional, New York, NY."},{"key":"e_1_3_2_9_2","first-page":"1","volume-title":"Network Science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"2016","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and M\u00e1rton P\u00f3sfai. 2016. Network Science. Cambridge University Press, Cambridge, UK, Chapter The scale-free property, 1\u201357."},{"key":"e_1_3_2_10_2","first-page":"1884","volume-title":"Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Birmel\u00e9 Etienne","year":"2013","unstructured":"Etienne Birmel\u00e9, Rui Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, and Gustavo Sacomoto. 2013. Optimal listing of cycles and st-paths in undirected graphs. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 1884\u20131896. DOI:10.1137\/1.9781611973105.134"},{"key":"e_1_3_2_11_2","first-page":"247","volume-title":"Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA\u201922)","author":"Blanu\u0161a Jovan","year":"2022","unstructured":"Jovan Blanu\u0161a, Paolo Ienne, and Kubilay Atasu. 2022. Scalable fine-grained parallel cycle enumeration algorithms. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA\u201922). ACM, Philadelphia, PA, 247\u2013258. DOI:10.1145\/3490148.3538585"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407853"},{"key":"e_1_3_2_13_2","first-page":"25.1\u201325.40","volume-title":"Parallel Algorithms","author":"Blelloch Guy E.","year":"2010","unstructured":"Guy E. Blelloch and Bruce M. Maggs. 2010. Parallel Algorithms. CRC Press, London, England, Chapter 25, 25.1\u201325.40."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-08746-5"},{"key":"e_1_3_2_18_2","first-page":"878","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing (Supercomputing\u201993)","author":"Forum CORPORATE The MPI","year":"1993","unstructured":"CORPORATE The MPI Forum. 1993. MPI: A message passing interface. In Proceedings of the ACM\/IEEE Conference on Supercomputing (Supercomputing\u201993). ACM Press, 878\u2013883. DOI:10.1145\/169627.169855"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/a10040115"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1968.1082837"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3380936"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02024498"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_68"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3322811"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/321541.321545"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx005"},{"key":"e_1_3_2_27_2","article-title":"General-purpose machine family: N1 machine series","author":"Cloud Google","year":"2022","unstructured":"Google Cloud. 2022. General-purpose machine family: N1 machine series. Retrieved from https:\/\/cloud.google.com\/compute\/docs\/general-purpose-machines. Accessed: 2022-11-14.","journal-title":"Retrieved from https:\/\/cloud.google.com\/compute\/docs\/general-purpose-machines"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_728"},{"key":"e_1_3_2_29_2","first-page":"343","volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201905).","author":"Gupta A.","year":"2005","unstructured":"A. Gupta and C. Selvidge. 2005. Acyclic modeling of combinational loops. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201905).IEEE, San Jose, CA, 343\u2013348. DOI:10.1109\/ICCAD.2005.1560091"},{"key":"e_1_3_2_30_2","unstructured":"Anshul Gupta and Toyotaro Suzumura. 2021. Finding All Bounded-Length Simple Cycles in a Directed Graph. Retrieved from https:\/\/arxiv:2105.10094"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-030-55814-7_12","volume-title":"Proceedings of the ADBIS, TPDL, and EDA Common Workshops and Doctoral Consortium","author":"Hajdu L\u00e1szl\u00f3","year":"2020","unstructured":"L\u00e1szl\u00f3 Hajdu and Mikl\u00f3s Kr\u00e9sz. 2020. Temporal network analytics for fraud detection in the banking sector. In Proceedings of the ADBIS, TPDL, and EDA Common Workshops and Doctoral Consortium. Springer, Cham, Switzerland, 145\u2013157. DOI:10.1007\/978-3-030-55814-7_12"},{"key":"e_1_3_2_32_2","first-page":"237","volume-title":"Proceedings of the 12th International Conference on Computers and Information Technology","author":"Islam M. d. Nazrul","year":"2009","unstructured":"M. d. Nazrul Islam, S. M. Rafizul Haque, Kaji Masudul Alam, and M. d. Tarikuzzaman. 2009. An approach to improve collusion set detection using MCL algorithm. In Proceedings of the 12th International Conference on Computers and Information Technology. IEEE, Dhaka, Bangladesh, 237\u2013242. DOI:10.1109\/ICCIT.2009.5407133"},{"key":"e_1_3_2_33_2","volume-title":"Introduction to Parallel Algorithms","author":"JaJa Joseph","year":"1992","unstructured":"Joseph JaJa. 1992. Introduction to Parallel Algorithms. Addison Wesley, Boston, MA."},{"key":"e_1_3_2_34_2","unstructured":"Jaroslaw Jankowski Rados\u0142law Michalski and Piotr Br\u00f3dka. 2017. Spreading processes in multilayer complex network within virtual world. https:\/\/www.nature.com\/articles\/sdata2017144"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1080\/21649502.2013.802877"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1967.1082699"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-181"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1535\/itj.1104.05"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236197"},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/2487788.2488173","volume-title":"Proceedings of the 22nd International Conference on World Wide Web (WWW\u201913)","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. KONECT: The Koblenz network collection. In Proceedings of the 22nd International Conference on World Wide Web (WWW\u201913). ACM Press, Rio de Janeiro, Brazil, 1343\u20131350. DOI:10.1145\/2487788.2488173"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-430"},{"key":"e_1_3_2_43_2","article-title":"SNAP Datasets: Stanford Large Network Dataset Collection","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from https:\/\/snap.stanford.edu\/data. Accessed: 2022-05-30.","journal-title":"Retrieved from https:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5906"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(82)90023-8"},{"key":"e_1_3_2_46_2","first-page":"135","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Malewicz Grzegorz","year":"2010","unstructured":"Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: A system for large-scale graph processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, Indianapolis, Indiana, 135\u2013146. DOI:10.1145\/1807167.1807184"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1137\/0205007"},{"key":"e_1_3_2_48_2","first-page":"1","volume-title":"Graph Technology for Financial Services","author":"Mathur Nav","year":"2017","unstructured":"Nav Mathur. 2017. Graph Technology for Financial Services. Technical Report. Neo4J. 1\u201314 pages. Retrieved from https:\/\/neo4j.com\/use-cases\/financial-services.Accessed: 2022-05-30."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/2567948.2576928","volume-title":"Proceedings of the 23rd International Conference on World Wide Web (WWW\u201914)","author":"Meusel Robert","year":"2014","unstructured":"Robert Meusel, Sebastiano Vigna, Oliver Lehmberg, and Christian Bizer. 2014. Graph structure in the web \u2014 revisited: A trick of the heavy tail. In Proceedings of the 23rd International Conference on World Wide Web (WWW\u201914). ACM Press, 427\u2013432. DOI:10.1145\/2567948.2576928"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/bs.host.2016.07.001"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2593264"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0076-8"},{"key":"e_1_3_2_54_2","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/3018661.3018731","volume-title":"Proceedings of the 10th ACM International Conference on Web Search and Data Mining","author":"Paranjape Ashwin","year":"2017","unstructured":"Ashwin Paranjape, Austin R. Benson, and Jure Leskovec. 2017. Motifs in temporal networks. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining. ACM, Cambridge, UK, 601\u2013610. DOI:10.1145\/3018661.3018731"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372720"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1137\/0114051"},{"key":"e_1_3_2_57_2","unstructured":"Sri Harsha Pothukuchi and Amit Dhuria. 2021. Deterministic loop breaking in multi-mode multi-corner static timing analysis of integrated circuits. Patent No. 11003821."},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59416-9_21"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_3_2_60_2","volume-title":"Parallel Programming in C with MPI and openMP","author":"Quinn Michael J.","year":"2004","unstructured":"Michael J. Quinn. 2004. Parallel Programming in C with MPI and openMP. McGraw-Hill, Dubuque, Iowa."},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.3.237"},{"key":"e_1_3_2_62_2","first-page":"1","volume-title":"Proceedings of the Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO\u201915)","author":"Rocha Rodrigo Caetano","year":"2015","unstructured":"Rodrigo Caetano Rocha and Bhalchandra D. Thatte. 2015. Distributed cycle detection in large-scale sparse graphs. In Proceedings of the Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO\u201915). SOBRAPO, Porto de Galinhas, Pernambuco, Brasil, 1\u201312. DOI:10.13140\/RG.2.1.1233.8640"},{"key":"e_1_3_2_63_2","first-page":"472","volume-title":"Proceedings of the 24th ACM Symposium on Operating Systems Principles","author":"Roy Amitabha","year":"2013","unstructured":"Amitabha Roy, Ivo Mihailovic, and Willy Zwaenepoel. 2013. X-Stream: Edge-centric graph processing using streaming partitions. In Proceedings of the 24th ACM Symposium on Operating Systems Principles. ACM, 472\u2013488. DOI:10.1145\/2517349.2522740"},{"key":"e_1_3_2_64_2","article-title":"SAS OPTGRAPH Procedure: Graph Algorithms and Network Analysis","year":"2021","unstructured":"SAS. 2021. SAS OPTGRAPH Procedure: Graph Algorithms and Network Analysis. Retrieved from https:\/\/documentation.sas.com\/doc\/en\/pgmsascdc\/9.4_3.5\/procgralg\/procgralg_optgraph_examples.htm. Accessed: 2022-05-30.","journal-title":"Retrieved from https:\/\/documentation.sas.com\/doc\/en\/pgmsascdc\/9.4_3.5\/procgralg\/procgralg_optgraph_examples.htm"},{"key":"e_1_3_2_65_2","first-page":"1","volume-title":"Proceedings of the IEEE Hot Chips 27 Symposium (HCS\u201915)","author":"Sodani Avinash","year":"2015","unstructured":"Avinash Sodani. 2015. Knights landing (KNL): 2nd Generation Intel Xeon Phi processor. In Proceedings of the IEEE Hot Chips 27 Symposium (HCS\u201915). IEEE, 1\u201324. DOI:10.1109\/HOTCHIPS.2015.7477467"},{"key":"e_1_3_2_66_2","article-title":"Anti-Money Laundering Datasets: InPlusLab Anti-Money Laundering Datasets","author":"Suzumura Toyotaro","year":"2021","unstructured":"Toyotaro Suzumura and Hiroki Kanezashi. 2021. Anti-Money Laundering Datasets: InPlusLab Anti-Money Laundering Datasets. Retrieved from https:\/\/github.com\/IBM\/AMLSim. Accessed: 2022-05-30.","journal-title":"Retrieved from https:\/\/github.com\/IBM\/AMLSim"},{"key":"e_1_3_2_67_2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF01931370","article-title":"A search strategy for the elementary cycles of a directed graph","volume":"16","author":"Szwarcfiter J.","year":"1976","unstructured":"J. Szwarcfiter and P. Lauer. 1976. A search strategy for the elementary cycles of a directed graph. BIT Numer. Math. 16 (1976), 192\u2013204.","journal-title":"BIT Numer. Math."},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202017"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/362814.362819"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_71_2","doi-asserted-by":"crossref","first-page":"3545","DOI":"10.1145\/3394486.3406469","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Wang Fei","year":"2020","unstructured":"Fei Wang, Peng Cui, Jian Pei, Yangqiu Song, and Chengxi Zang. 2020. Recent advances on graph analytics and its applications in healthcare. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, 3545\u20133546. DOI:10.1145\/3394486.3406469"},{"key":"e_1_3_2_72_2","first-page":"1","volume-title":"Powering Real-Time Recommendations with Graph Database Technology","author":"Webber Jim","year":"2021","unstructured":"Jim Webber. 2021. Powering Real-Time Recommendations with Graph Database Technology. Technical Report. Neo4J. 1\u20137 pages. Retrieved from https:\/\/neo4j.com\/use-cases\/real-time-recommendation-engine.Accessed: 2022-05-30."},{"issue":"1","key":"e_1_3_2_73_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321679.321684","article-title":"A new search algorithm for finding the simple cycles of a finite directed graph","volume":"19","author":"Weinblatt Herbert","year":"1972","unstructured":"Herbert Weinblatt. 1972. A new search algorithm for finding the simple cycles of a finite directed graph. J. ACM 19, 1 (Jan.1972), 43\u201356.","journal-title":"J. ACM"},{"key":"e_1_3_2_74_2","first-page":"296","volume-title":"Proceedings of the 20th National Conference","author":"Welch J. T.","year":"1965","unstructured":"J. T. Welch. 1965. Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications. In Proceedings of the 20th National Conference. ACM Press, 296\u2013301. DOI:10.1145\/800197.806053"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-30249-4"}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611642","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3611642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:10Z","timestamp":1750178230000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,21]]},"references-count":74,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1145\/3611642"],"URL":"https:\/\/doi.org\/10.1145\/3611642","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"value":"2329-4949","type":"print"},{"value":"2329-4957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,21]]},"assertion":[{"value":"2023-02-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-07","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}