A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of algorithms which require nonlinear time to maintain disjoint sets |
scientific article; zbMATH DE number 3642703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of algorithms which require nonlinear time to maintain disjoint sets |
scientific article; zbMATH DE number 3642703 |
Statements
A class of algorithms which require nonlinear time to maintain disjoint sets (English)
0 references
1979
0 references
computational complexity
0 references
algorithms
0 references
disjoint set union problem
0 references
find operations
0 references
machine model
0 references
nonlinear lower bound
0 references
0 references
