DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Lowest common ancestor
Lowest common ancestor
Lowest Common Ancestors in Trees and Directed Acyclic Graphs1
Minimum Cut in $ O (M\Log^ 2 N) $ Time
Compressed Range Minimum Queries⋆
Common Ancestor Algorithms in Dags
Race Detection in Two Dimensions
Arxiv:2001.07765V1 [Cs.DS] 21 Jan 2020 749022 and Has Been Supported by Pareto-Optimal Parameterized Algorithms, ERC Starting Grant 715744
A Scalable Approach to Computing Representative Lowest Common Ancestor in Directed Acyclic Graphs
Limits of Structures and the Example of Tree-Semilattices Pierre Charbit, Lucas Hosseini, Patrice Ossona De Mendez
Succinct Representations of Weighted Trees Supporting Path Queries ✩ ∗ Manish Patil, Rahul Shah, Sharma V
Scribe Notes
The Algorithm of Heavy Path Decomposition Based on Segment Tree
Faster and Enhanced Inclusion-Minimal Cograph Completion
New Common Ancestor Problems in Trees and Directed Acyclic Graphs
Parallel Recognition of Complement Reducible Graphs and Cotree Constructiont
Tarjan's Lowest Common Ancestor Algorithm
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Dynamic Optimality—Almost∗
Measuring Phenotype-Phenotype Similarity Through the Interactome Jiajie Peng, Weiwei Hui and Xuequn Shang*
Top View
A Fast Algorithm for Online K-Servers Problem on Trees
K-Cographs Are Kruskalian∗
Sliding Suffix Tree
Arxiv:2007.08914V2 [Cs.DS] 13 Nov 2020 Manner
Lecture 15 Student Notes
Lowest Common Ancestor
A Fully-Compressed Suffix Trees
Acyclic and Star Colorings of Cographs✩ Andrew Lyons ∗ Department of Computer Science, Dartmouth College, United States Article Info a B S T R a C T
Suffix Trees
A New Linear-Time Algorithm for Centroid Decomposition ⋆
Lowest Common Ancestor(LCA)
Faster Algorithms for Finding Lowest Common Ancestors in Directed
Scribe Notes
Multi-Core Spanning Forest Algorithms Using the Disjoint-Set Data Structure Md
The Nearest Colored Node in a Tree
Improved Algorithms for the All-Pairs Lowest Common Ancestor Problem in Directed Acyclic Graphs⋆
INSTITUT F¨UR INFORMATIK All-Pairs Common-Ancestor