Pages that link to "Item:Q2768390"
From MaRDI portal
The following pages link to Finding least common ancestors in directed acyclic graphs (Q2768390):
Displaying 10 items.
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- Finding lowest common ancestors in arbitrarily directed trees (Q1330662) (← 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)
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication (Q3527218) (← links)
- A Data Structure for Nearest Common Ancestors with Linking (Q4554935) (← links)
- Lowest common ancestors in trees and directed acyclic graphs (Q5711726) (← links)
- Automata, Languages and Programming (Q5716778) (← links)
