Hong Shen. Fast Parallel Algorithm for Finding the kth Longest Path in A Tree*. In Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC 97), March 19-21, 1997, Shanghai, China. pages 164-169, IEEE Computer Society, 1997. [doi]
@inproceedings{Shen97,
title = {Fast Parallel Algorithm for Finding the kth Longest Path in A Tree*},
author = {Hong Shen},
year = {1997},
doi = {10.1109/APDC.1997.574028},
url = {http://doi.ieeecomputersociety.org/10.1109/APDC.1997.574028},
researchr = {https://researchr.org/publication/Shen97},
cites = {0},
citedby = {0},
pages = {164-169},
booktitle = {Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC 97), March 19-21, 1997, Shanghai, China},
publisher = {IEEE Computer Society},
}