"Two minimum spanning forest algorithms on fixed-size hypercube computers."

Sajal K. Das, Narsingh Deo, Sushil K. Prasad (1990)

> Home

Details and statistics

DOI: 10.1016/0167-8191(90)90041-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/DasDP90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/DasDP90
Sajal K. Das, Narsingh Deo, Sushil K. Prasad:
Two minimum spanning forest algorithms on fixed-size hypercube computers. Parallel Comput. 15(1-3): 179-187 (1990)

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.