"Parallel VLSI computation of all shortest paths in a graph."

Sujit Dey, Pradip K. Srimani (1988)

> Home

Details and statistics

DOI: 10.1145/322609.322778

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acm/DeyS88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/DeyS88
Sujit Dey, Pradip K. Srimani:
Parallel VLSI computation of all shortest paths in a graph. ACM Conference on Computer Science 1988: 373-379

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.