PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA

Zhengmin Lai, You Peng, Shiyu Yang, Xuemin Lin 0001, Wenjie Zhang 0001. PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA. In 37th IEEE International Conference on Data Engineering, ICDE 2021, Chania, Greece, April 19-22, 2021. pages 1320-1331, IEEE, 2021. [doi]

@inproceedings{LaiPY0021,
  title = {PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA},
  author = {Zhengmin Lai and You Peng and Shiyu Yang and Xuemin Lin 0001 and Wenjie Zhang 0001},
  year = {2021},
  doi = {10.1109/ICDE51399.2021.00118},
  url = {https://doi.org/10.1109/ICDE51399.2021.00118},
  researchr = {https://researchr.org/publication/LaiPY0021},
  cites = {0},
  citedby = {0},
  pages = {1320-1331},
  booktitle = {37th IEEE International Conference on Data Engineering, ICDE 2021, Chania, Greece, April 19-22, 2021},
  publisher = {IEEE},
  isbn = {978-1-7281-9184-3},
}