On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem (Q3756517): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0215072 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2067411846 / rank | |||
Normal rank |
Latest revision as of 21:13, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem |
scientific article |
Statements
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem (English)
0 references
1986
0 references
data structure
0 references
time complexity
0 references
lower bound
0 references
algorithm
0 references
disjoint set union problem
0 references