"Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning ..."

Christos D. Zaroliagis (1997)

> Home

Details and statistics

DOI: 10.1142/S012962649700005X

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ppl/Zaroliagis97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppl/Zaroliagis97
Christos D. Zaroliagis:
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem. Parallel Process. Lett. 7(1): 25-37 (1997)

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.