Accelerating breadth-first graph search on a single server by dynamic edge trimming

Guangyan Zhang, Shu-han Cheng, Jiwu Shu, Qingda Hu, Weimin Zheng. Accelerating breadth-first graph search on a single server by dynamic edge trimming. J. Parallel Distrib. Comput., 120:383-394, 2018. [doi]

@article{ZhangCSHZ18,
  title = {Accelerating breadth-first graph search on a single server by dynamic edge trimming},
  author = {Guangyan Zhang and Shu-han Cheng and Jiwu Shu and Qingda Hu and Weimin Zheng},
  year = {2018},
  doi = {10.1016/j.jpdc.2017.09.007},
  url = {https://doi.org/10.1016/j.jpdc.2017.09.007},
  researchr = {https://researchr.org/publication/ZhangCSHZ18},
  cites = {0},
  citedby = {0},
  journal = {J. Parallel Distrib. Comput.},
  volume = {120},
  pages = {383-394},
}