"On the Single-Operation Worst-Case Time Complexity of the Disjoint Set ..."

Norbert Blum (1986)

> Home

Details and statistics

DOI: 10.1137/0215072

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Blum86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Blum86
Norbert Blum:
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. SIAM J. Comput. 15(4): 1021-1024 (1986)

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.