"A minimum spanning tree algorithm with Inverse-Ackermann type complexity."

Bernard Chazelle (2000)

> Home

Details and statistics

DOI: 10.1145/355541.355562

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Chazelle00a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Chazelle00a
Bernard Chazelle:
A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM 47(6): 1028-1047 (2000)

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.