Edwards, C. (2023) „Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.“, Communications of the ACM, 66(9), S. 10-12. doi:10.1145/3607866.
Chicago Manual of Style 17th edition (full note)Edwards, Chris. „Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By Revisiting Key Algorithms from Computing, a Team Unlocked Hidden Efficiency in a Long-Standing Computer Science Problem.“. Communications of the ACM 66, Nr. 9 (1. September 2023): 10-12. https://doi.org/10.1145/3607866.
American Psychological Association 7th editionEdwards, C. (2023). Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem. Communications of the ACM, 66(9), 10-12. https://doi.org/10.1145/3607866
Modern Language Association 9th editionEdwards, C. „Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By Revisiting Key Algorithms from Computing, a Team Unlocked Hidden Efficiency in a Long-Standing Computer Science Problem.“. Communications of the ACM, Bd. 66, Nr. 9, September 2023, S. 10-12, https://doi.org/10.1145/3607866.
ISO-690 (author-date, Deutsch)EDWARDS, Chris, 2023. Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem. Communications of the ACM. 1 September 2023. Bd. 66, Nr. 9, S. 10-12. DOI 10.1145/3607866