Pages that link to "Item:Q3319776"
From MaRDI portal
The following pages link to Fast Algorithms for Finding Nearest Common Ancestors (Q3319776):
Displaying 50 items.
- Dynamic planar range skyline queries in log logarithmic expected time (Q2203584) (← links)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- Multidimensional segment trees can do range updates in poly-logarithmic time (Q2220857) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Analytical description of digital intersections: minimal parameters and multiscale representation (Q2317875) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Approximate periodicity (Q2343134) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Computing the \(K\)-terminal reliability of directed path graphs (Q2348708) (← links)
- Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Optimal parallel verification of minimum spanning trees in logarithmic time (Q2365173) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Generalized LCS (Q2378524) (← links)
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor (Q2383600) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- On finding the Adams consensus tree (Q2407110) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Best match graphs (Q2420450) (← links)
- Fast arc-annotated subsequence matching in linear space (Q2428660) (← links)
- Faster swap edge computation in minimum diameter spanning trees (Q2428664) (← links)
- Fast smallest lowest common ancestor computation based on stable match (Q2434584) (← links)
- Generalized substring compression (Q2437745) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Computing the rooted triplet distance between galled trees by counting triangles (Q2442817) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Decomposition algorithms for the tree edit distance problem (Q2569420) (← links)
- Quasi-linear algorithms for the topological watershed (Q2573032) (← links)
