Cite Them Right 11th edition - Harvard

Hong Shen (1997) „Fast parallel algorithm for finding the kth longest path in a tree“, in. doi:10.1109/APDC.1997.574028.

Chicago Manual of Style 17th edition (full note)

Hong Shen. „Fast Parallel Algorithm for Finding the Kth Longest Path in a Tree“. In . https://doi.org/10.1109/APDC.1997.574028.

American Psychological Association 7th edition

Hong Shen. (1997, Januar 1). Fast parallel algorithm for finding the kth longest path in a tree. https://doi.org/10.1109/APDC.1997.574028

Modern Language Association 9th edition

Hong Shen. Fast Parallel Algorithm for Finding the Kth Longest Path in a Tree. 1997, https://doi.org/10.1109/APDC.1997.574028.

ISO-690 (author-date, Deutsch)

HONG SHEN, 1997. Fast parallel algorithm for finding the kth longest path in a tree. In: . 1 Januar 1997

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