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. Vol. 66, no. 9, p. 10-12. DOI 10.1145/3607866.
Elsevier - Harvard (with titles)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, 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
Springer - Basic (author-date)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:10-12. https://doi.org/10.1145/3607866
Juristische Zitierweise (Stüber) (Deutsch)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 2023, 10-12.