Pages that link to "Item:Q706323"
From MaRDI portal
The following pages link to Nearest common ancestors: a survey and a new algorithm for a distributed environment (Q706323):
Displayed 31 items.
- Longest common extensions in trees (Q294947) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (Q2810272) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- A Simple and Optimal Ancestry Labeling Scheme for Trees (Q3449505) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Short Labels by Traversal and Jumping (Q5899392) (← links)
- Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293) (← links)