Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook

Research output: Contribution to journalConference articlepeer-review

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 languageEnglish
Pages (from-to)279-288
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: 23 May 199826 May 1998

Fingerprint

Dive into the research topics of 'Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators'. Together they form a unique fingerprint.

Cite this