Approximate Shortest Path Queries in Graphs Using Voronoi Duals

Shinichi Honiden, Michael E. Houle, Christian Sommer 0002, Martin Wolff. Approximate Shortest Path Queries in Graphs Using Voronoi Duals. In Francois Anton, editor, Sixth International Symposium on Voronoi Diagrams, ISVD 2009, Copenhagen, Denmark, June 23-26, 2009. pages 53-62, IEEE Computer Society, 2009. [doi]

@inproceedings{HonidenHSW09,
  title = {Approximate Shortest Path Queries in Graphs Using Voronoi Duals},
  author = {Shinichi Honiden and Michael E. Houle and Christian Sommer 0002 and Martin Wolff},
  year = {2009},
  doi = {10.1109/ISVD.2009.30},
  url = {http://doi.ieeecomputersociety.org/10.1109/ISVD.2009.30},
  tags = {graph query, graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/HonidenHSW09},
  cites = {0},
  citedby = {0},
  pages = {53-62},
  booktitle = {Sixth International Symposium on Voronoi Diagrams, ISVD 2009, Copenhagen, Denmark, June 23-26, 2009},
  editor = {Francois Anton},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3781-8},
}