Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs

Chin-Wen Ho, Jou-Ming Chang. Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. Inf. Process. Lett., 69(2):87-93, 1999. [doi]

@article{HoC99,
  title = {Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs},
  author = {Chin-Wen Ho and Jou-Ming Chang},
  year = {1999},
  doi = {10.1016/S0020-0190(98)00195-1},
  url = {http://dx.doi.org/10.1016/S0020-0190(98)00195-1},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HoC99},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {69},
  number = {2},
  pages = {87-93},
}