"Fast massively parallel algorithms for shortest path within planar figures."

Adam Kapralski (1996)

> Home

Details and statistics

DOI: 10.1007/S003710050081

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/vc/Kapralski96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vc/Kapralski96
Adam Kapralski:
Fast massively parallel algorithms for shortest path within planar figures. Vis. Comput. 12(10): 484-502 (1996)

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.