"Minimal spanning trees: an empirical investigation of parallel algorithms."

Richard S. Barr, R. V. Helgaon, Jeffery L. Kennington (1989)

> Home

Details and statistics

DOI: 10.1016/0167-8191(89)90005-7

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/HelgaonK89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/HelgaonK89
Richard S. Barr, R. V. Helgaon, Jeffery L. Kennington:
Minimal spanning trees: an empirical investigation of parallel algorithms. Parallel Comput. 12(1): 45-52 (1989)

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.