Finding Lowest Common Ancestors in Parallel

DOI10.1109/TC.1986.1676830zbMath0592.68060OpenAlexW2040013583MaRDI QIDQ3721831

Yung Hyang Tsin

Publication date: 1986

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1986.1676830

zbMATH Keywords

parallel computationparallel algorithmsgraph algorithmsPRAMundirected graphdirected treefundamental cyclesSIMD

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses ⋮ An optimal parallel processor bound in strong orientation of an undirected graph

This page was built for publication: Finding Lowest Common Ancestors in Parallel