TY - JOUR
T1 - Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
AU - Buchsbaum, Adam L.
AU - Kaplan, Haim
AU - Rogers, Anne
AU - Westbrook, Jeffery R.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0031631006&partnerID=8YFLogxK
U2 - 10.1145/276698.276764
DO - 10.1145/276698.276764
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0031631006
SN - 0734-9025
SP - 279
EP - 288
JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
T2 - Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing
Y2 - 23 May 1998 through 26 May 1998
ER -