Efficient Parallel Shortest Path Algorithms for K-Chordal Graphs

Pinaki Mitra. Efficient Parallel Shortest Path Algorithms for K-Chordal Graphs. In Viktor K. Prasanna, Larry H. Canter, editors, Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, March 1992. pages 88-94, IEEE Computer Society, 1992.

@inproceedings{Mitra92,
  title = {Efficient Parallel Shortest Path Algorithms for K-Chordal Graphs},
  author = {Pinaki Mitra},
  year = {1992},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Mitra92},
  cites = {0},
  citedby = {0},
  pages = {88-94},
  booktitle = {Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, March 1992},
  editor = {Viktor K. Prasanna and Larry H. Canter},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-2672-0},
}