scientific article; zbMATH DE number 4064469
From MaRDI portal
Publication:3798229
Recommendations
Cited in
(19)- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Data structures and algorithms for approximate string matching
- 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
- New algorithms for the LCA problem and the binary tree reconstruction problem
- Finding level-ancestors in trees
- Finding lowest common ancestors in arbitrarily directed trees
- Robust hierarchical feature selection driven by data and knowledge
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Fast smallest lowest common ancestor computation based on stable match
- Fast Algorithms for Finding Nearest Common Ancestors
- Simple parallel algorithms for dynamic range products
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
- Finding Lowest Common Ancestors in Parallel
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- scientific article; zbMATH DE number 88972 (Why is no real title available?)
- scientific article; zbMATH DE number 753968 (Why is no real title available?)
- Parallel dynamic lowest common ancestors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798229)
