"An adaptive and cost-optimal parallel algorithm for minimum spanning trees."

Selim G. Akl (1986)

> Home

Details and statistics

DOI: 10.1007/BF02240073

access: closed

type: Journal Article

metadata version: 2020-08-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computing/Akl86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/Akl86
Selim G. Akl:
An adaptive and cost-optimal parallel algorithm for minimum spanning trees. Computing 36(3): 271-277 (1986)

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.