"A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon."

Pardis Kavand, Ali Mohades (2018)

> Home

Details and statistics

DOI: 10.1142/S0129054118500107

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/KavandM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/KavandM18
Pardis Kavand, Ali Mohades:
A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon. Int. J. Found. Comput. Sci. 29(3): 391-402 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.