A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree

MaRDI QIDQ2923974zbMATHFDO

Authors Jue Wang

Publication date 3 November 2014

Published in Journal of Foshan University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

binary treelowest common ancestor

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
• scientific article; zbMATH DE number 1512678
• Lowest common ancestors in trees and directed acyclic graphs
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A fast cost-optimal parallel algorithm for the lowest common ancestor problem

Cited in

(3)

• Fast smallest lowest common ancestor computation based on stable match
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs
• Finding lowest common ancestors in arbitrarily directed trees

This page was built for publication: A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree

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