Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators

@inproceedings{Buchsbaum1998LinearTimePA,
  title={Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators},
  author={Adam L. Buchsbaum and Haim Kaplan and Anne Rogers and Jeffery Westbrook},
  booktitle={STOC},
  year={1998}
}
WC 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 llrat 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.