Linear expected-time algorithms for connectivity problems (Q3914449): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Richard M. Karp / rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
| Property / author | |||
| Property / author: Richard M. Karp / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
| 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.1016/0196-6774(80)90017-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080548021 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear expected-time algorithms for connectivity problems |
scientific article |
Statements
Linear expected-time algorithms for connectivity problems (English)
0 references
1980
0 references
fast average-time algorithms
0 references
graph connectivity
0 references
minimum spanning forest
0 references
analysis of algorithms
0 references
random graph model
0 references
