American Psychological Association 6th edition

Henke, L., & Mehta, D. (2024). DC-RST: a parallel algorithm for random spanning trees in network analytics. Applied Network Science, 9(1). https://doi.org/10.1007/s41109-024-00613-7

ISO-690 (author-date, English)

HENKE, Luke and MEHTA, Dinesh, 2024. DC-RST: a parallel algorithm for random spanning trees in network analytics. Applied Network Science. 1 December 2024. Vol. 9, no. 1, . DOI 10.1007/s41109-024-00613-7.

Modern Language Association 9th edition

Henke, L., and D. Mehta. “DC-RST: A Parallel Algorithm for Random Spanning Trees in Network Analytics”. Applied Network Science, vol. 9, no. 1, Dec. 2024, https://doi.org/10.1007/s41109-024-00613-7.

Mohr Siebeck - Recht (Deutsch - Österreich)

Henke, Luke/Mehta, Dinesh: DC-RST: a parallel algorithm for random spanning trees in network analytics, Applied Network Science 2024,

Emerald - Harvard

Henke, L. and Mehta, D. (2024), “DC-RST: a parallel algorithm for random spanning trees in network analytics”, Applied Network Science, Vol. 9 No. 1, available at:https://doi.org/10.1007/s41109-024-00613-7.

Warning: These citations may not always be 100% accurate.