PENG, Richard, 2025. Shortening the Path to Designing Efficient Graph Algorithms. Communications of the ACM. 1 Februar 2025. Vol. 68, no. 2, p. 86-86. DOI 10.1145/3660528.
Elsevier - Harvard (with titles)Peng, R., 2025. Shortening the Path to Designing Efficient Graph Algorithms. Communications of the ACM 68, 86-86. https://doi.org/10.1145/3660528
American Psychological Association 7th editionPeng, R. (2025). Shortening the Path to Designing Efficient Graph Algorithms. Communications of the ACM, 68(2), 86-86. https://doi.org/10.1145/3660528
Springer - Basic (author-date)Peng R (2025) Shortening the Path to Designing Efficient Graph Algorithms.. Communications of the ACM 68:86-86. https://doi.org/10.1145/3660528
Juristische Zitierweise (Stüber) (Deutsch)Peng, Richard, Shortening the Path to Designing Efficient Graph Algorithms., Communications of the ACM 2025, 86-86.