Pages that link to "Item:Q1330662"
From MaRDI portal
The following pages link to Finding lowest common ancestors in arbitrarily directed trees (Q1330662):
Displaying 9 items.
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- The lowest common ancestor problem on a tree with an unfixed root (Q1961826) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication (Q3527218) (← links)
- On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152) (← links)
- A Data Structure for Nearest Common Ancestors with Linking (Q4554935) (← links)
