Approximate Distance Queries in Disk Graphs

Martin Fürer, Shiva Prasad Kasiviswanathan. Approximate Distance Queries in Disk Graphs. In Thomas Erlebach, Christos Kaklamanis, editors, Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers. Volume 4368 of Lecture Notes in Computer Science, pages 174-187, Springer, 2006. [doi]

@inproceedings{FurerK06,
  title = {Approximate Distance Queries in Disk Graphs},
  author = {Martin Fürer and Shiva Prasad Kasiviswanathan},
  year = {2006},
  doi = {10.1007/11970125_14},
  url = {http://dx.doi.org/10.1007/11970125_14},
  tags = {graph query, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FurerK06},
  cites = {0},
  citedby = {0},
  pages = {174-187},
  booktitle = {Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
  editor = {Thomas Erlebach and Christos Kaklamanis},
  volume = {4368},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-69513-3},
}