American Psychological Association 6th edition

Ji, F., & Jin, J. (2025). A map-reduce algorithm to find strongly connected components of directed graphs. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 1-20. https://doi.org/10.1007/s00500-025-10451-z

ISO-690 (author-date, English)

JI, Fujun und JIN, Jidong, 2025. A map-reduce algorithm to find strongly connected components of directed graphs. Soft Computing: A Fusion of Foundations, Methodologies and Applications. 25 Februar 2025. P. 1-20. DOI 10.1007/s00500-025-10451-z.

Modern Language Association 9th edition

Ji, F., und J. Jin. „A Map-Reduce Algorithm to Find Strongly Connected Components of Directed Graphs“. Soft Computing: A Fusion of Foundations, Methodologies and Applications, Februar 2025, S. 1-20, https://doi.org/10.1007/s00500-025-10451-z.

Mohr Siebeck - Recht (Deutsch - Österreich)

Ji, Fujun/Jin, Jidong: A map-reduce algorithm to find strongly connected components of directed graphs, Soft Computing: A Fusion of Foundations, Methodologies and Applications 2025, 1-20.

Emerald - Harvard

Ji, F. und Jin, J. (2025), „A map-reduce algorithm to find strongly connected components of directed graphs“, Soft Computing: A Fusion of Foundations, Methodologies and Applications, S. 1-20.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.