Applications of Path Compression on Balanced Trees (Q3048273): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56209648, #quickstatements; #temporary_batch_1706974288397 |
Created claim: DBLP publication ID (P1635): journals/jacm/Tarjan79, #quickstatements; #temporary_batch_1731475607626 |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / 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.1145/322154.322161 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023658462 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/Tarjan79 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 07:09, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applications of Path Compression on Balanced Trees |
scientific article |
Statements
Applications of Path Compression on Balanced Trees (English)
0 references
1979
0 references
path compression
0 references
balanced trees
0 references
functional inverse of Ackermann's function
0 references
minimum spanning tree
0 references
undirected graph
0 references
dominators in a flow graph
0 references
graph algorithm
0 references
computational complexity
0 references
