External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Computing the Shortest Path Tree in a Weak Visibility Polygon

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.

Abstract

Abstract is missing.

runs on