Efficient Parallel Algorithms for Constructing a ::::k::::-Tree Center and a ::::k::::-Tree Core of a Tree Network

Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian. Efficient Parallel Algorithms for Constructing a ::::k::::-Tree Center and a ::::k::::-Tree Core of a Tree Network. In Xiaotie Deng, Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings. Volume 3827 of Lecture Notes in Computer Science, pages 553-562, Springer, 2005. [doi]

@inproceedings{WangWLT05,
  title = {Efficient Parallel Algorithms for Constructing a ::::k::::-Tree Center and a ::::k::::-Tree Core of a Tree Network},
  author = {Yan Wang and Deqiang Wang and Wei Liu and Baoyu Tian},
  year = {2005},
  doi = {10.1007/11602613_56},
  url = {http://dx.doi.org/10.1007/11602613_56},
  researchr = {https://researchr.org/publication/WangWLT05},
  cites = {0},
  citedby = {0},
  pages = {553-562},
  booktitle = {Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  editor = {Xiaotie Deng and Ding-Zhu Du},
  volume = {3827},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-30935-7},
}