"What features really make distributed minimum spanning tree algorithms ..."

Michalis Faloutsos, Mart L. Molle (1996)

> Home

Details and statistics

DOI: 10.1109/ICPADS.1996.517551

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/icpads/FaloutsosM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpads/FaloutsosM96
Michalis Faloutsos, Mart L. Molle:
What features really make distributed minimum spanning tree algorithms efficient?. ICPADS 1996: 106-

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.