Linear expected time of a simple union-find algorithm (Q1233316): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(76)90061-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989351810 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4140369 / rank | |||
Normal rank | |||
Latest revision as of 20:24, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear expected time of a simple union-find algorithm |
scientific article |
Statements
Linear expected time of a simple union-find algorithm (English)
0 references
1976
0 references
