"Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem ..."

Elias Dahlhaus (1992)

> Home

Details and statistics

DOI: 10.1007/3-540-56402-0_36

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/Dahlhaus92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/Dahlhaus92
Elias Dahlhaus:
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. WG 1992: 60-69

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.