"An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm ..."

Francis Y. L. Chin, H. F. Ting (1985)

> Home

Details and statistics

DOI: 10.1109/SFCS.1985.7

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/ChinT85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ChinT85
Francis Y. L. Chin, H. F. Ting:
An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. FOCS 1985: 257-266

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.