Fast smallest lowest common ancestor computation based on stable match

DOI10.1007/S11390-013-1337-1zbMATH Open1280.68086OpenAlexW1996570788MaRDI QIDQ2434584FDOQ2434584

Authors: Jun-Feng Zhou, Guo-Xiang Lan, Zi-Yang Chen, Xian Tang 

Publication date: 6 February 2014

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11390-013-1337-1

Recommendations

• Fast Lowest Common Ancestor Computations in Dags
• A fast cost-optimal parallel algorithm for the lowest common ancestor problem
• Fast Algorithms for Finding Nearest Common Ancestors
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs
• scientific article; zbMATH DE number 4064469
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
• A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree
• A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
• Finding Lowest Common Ancestors in Parallel

zbMATH Keywords

XMLkeyword searchsmallest lowest common ancestor

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (4)

• On Finding Lowest Common Ancestors: Simplification and Parallelization
• An approach of top-\(k\) keyword querying for fuzzy XML
• A layered solution for the SLCA problem in XML information retrieval
• Fast Algorithms for Finding Nearest Common Ancestors

Uses Software

• XSEarch

This page was built for publication: Fast smallest lowest common ancestor computation based on stable match

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