Pages that link to "Item:Q5711726"
From MaRDI portal
The following pages link to Lowest common ancestors in trees and directed acyclic graphs (Q5711726):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Succinct dynamic cardinal trees (Q262263) (← links)
- Succinct posets (Q329288) (← links)
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- Tree path majority data structures (Q784481) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
- Range mode and range median queries in constant time and sub-quadratic space (Q976080) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- Exploratory knowledge discovery over web of data (Q1800378) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Compatibility of partitions with trees, hierarchies, and split systems (Q2127632) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Finding maximum sum segments in sequences with uncertainty (Q2216439) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (Q2810272) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max (Q3448818) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- (Q4558170) (← links)
- (Q5091005) (← links)
- (Q5091063) (← links)
- (Q5111799) (← links)
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint (Q5387633) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees (Q6072286) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
