Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan. Computing the Shortest Path Tree in a Weak Visibility Polygon. In Somenath Biswas, Kesav V. Nori, editors, Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings. Volume 560 of Lecture Notes in Computer Science, pages 369-389, Springer, 1991.
@inproceedings{GoshMPSM91,
title = {Computing the Shortest Path Tree in a Weak Visibility Polygon},
author = {Subir Kumar Ghosh and Anil Maheshwari and Sudebkumar Prasant Pal and Sanjeev Saluja and C. E. Veni Madhavan},
year = {1991},
tags = {C++, e-science},
researchr = {https://researchr.org/publication/GoshMPSM91},
cites = {0},
citedby = {0},
pages = {369-389},
booktitle = {Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
editor = {Somenath Biswas and Kesav V. Nori},
volume = {560},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54967-6},
}