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.
- A simpler minimum spanning tree verification algorithm (Q1355729) (← links)
- Tree structure for distributive lattices and its applications (Q1366682) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- The complexity of the locally connected spanning tree problem (Q1408813) (← links)
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062) (← links)
- The nearest common ancestor in a dynamic tree (Q1821561) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- An optimal data structure to handle dynamic environments in non-deterministic computations (Q1869983) (← links)
- When can you fold a map? (Q1883580) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- A robust model for finding optimal evolutionary tree (Q1902471) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- The lowest common ancestor problem on a tree with an unfixed root (Q1961826) (← links)
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem (Q2172416) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
