O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs

Alan P. Sprague, Tadao Takaoka. O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs. Int. J. Found. Comput. Sci., 10(4):465-472, 1999.

@article{SpragueT99,
  title = {O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs},
  author = {Alan P. Sprague and Tadao Takaoka},
  year = {1999},
  tags = {graph query, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/SpragueT99},
  cites = {0},
  citedby = {0},
  journal = {Int. J. Found. Comput. Sci.},
  volume = {10},
  number = {4},
  pages = {465-472},
}