Parallel Shortest-Path Queries in Planar Graphs

Lyudmil Aleksandrov, Guillaume Chapuis, Hristo Djidjev. Parallel Shortest-Path Queries in Planar Graphs. In Toyotaro Suzumura, Dario Garcia-Gasulla, Miyuru Dayarathna, editors, Proceedings of the ACM Workshop on High Performance Graph Processing, HPGP@HPDC 2016, Kyoto, Japan, May 31, 2016. pages 9-16, ACM, 2016. [doi]

@inproceedings{AleksandrovCD16,
  title = {Parallel Shortest-Path Queries in Planar Graphs},
  author = {Lyudmil Aleksandrov and Guillaume Chapuis and Hristo Djidjev},
  year = {2016},
  doi = {10.1145/2915516.2915518},
  url = {http://doi.acm.org/10.1145/2915516.2915518},
  researchr = {https://researchr.org/publication/AleksandrovCD16},
  cites = {0},
  citedby = {0},
  pages = {9-16},
  booktitle = {Proceedings of the ACM Workshop on High Performance Graph Processing, HPGP@HPDC 2016, Kyoto, Japan, May 31, 2016},
  editor = {Toyotaro Suzumura and Dario Garcia-Gasulla and Miyuru Dayarathna},
  publisher = {ACM},
  isbn = {978-1-4503-4350-3},
}