Finding Lowest Common Ancestors in Parallel

DOI10.1109/TC.1986.1676830MaRDI QIDQ3721831zbMATH OpenOpenAlexFDO

Authors Yung H. 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

directed treefundamental cyclesgraph algorithmsparallel algorithmsparallel computationPRAMSIMDundirected graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4064469
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• scientific article; zbMATH DE number 753968
• Parallel dynamic lowest common ancestors

Cited in

(14)

• An optimal parallel processor bound in strong orientation of an undirected graph
• Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
• A fast cost-optimal parallel algorithm for the lowest common ancestor problem
• Finding level-ancestors in trees
• Finding lowest common ancestors in arbitrarily directed trees
• Fast smallest lowest common ancestor computation based on stable match
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
• scientific article; zbMATH DE number 4064469 (Why is no real title available?)
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• scientific article; zbMATH DE number 54593 (Why is no real title available?)
• Recursive Star-Tree Parallel Data Structure
• scientific article; zbMATH DE number 753968 (Why is no real title available?)
• Parallel dynamic lowest common ancestors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721831)