Abstract
We present two new data structure tools - disjoint set union with bottom-up linking, and pointer-based radix sort - and combine them with bottom-level microtrees to devise the first linear-time pointer-machine algorithms for off-line least common ancestors, minimum spanning tree (MST) verification, randomized MST construction, and computing dominators in a flowgraph.
Original language | English |
---|---|
Pages (from-to) | 279-288 |
Number of pages | 10 |
Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA Duration: 23 May 1998 → 26 May 1998 |