A data structure for dynamic trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- An Efficient Method for Storing Ancestor Information in Trees
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Applications of Path Compression on Balanced Trees
- Biased Search Trees
- Binary Search Trees of Bounded Balance
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient algorithms for a family of matroid intersection problems
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors in Trees
- Programming as a Discipline of Mathematical Nature
- Worst-case Analysis of Set Union Algorithms
Cited in
(only showing first 100 items - show all)- Dynamic hotlinks
- The constrained minimum spanning tree problem
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems
- Dynamic maintenance of directed hypergraphs
- Fast compressed self-indexes with deterministic linear-time construction
- Finding paths and deleting edges in directed acyclic graphs
- Longest common substring made fully dynamic
- Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
- Dynamic Trees and Dynamic Point Location
- On-line updating of solutions to a class of matroid intersection problems
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees
- scientific article; zbMATH DE number 7561709 (Why is no real title available?)
- Temporal separators with deadlines
- Computing a subtrajectory cluster from c-packed trajectories
- Confluent persistence revisited
- Dynamic dictionary matching
- Two-dimensional dynamic dictionary matching
- Linear-space data structures for range frequency queries on arrays and trees
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
- Dynamic and static algorithms for optimal placement of resources in a tree
- Partial inverse min-max spanning tree problem
- Tight bounds for online weighted tree augmentation
- Routing on heavy-path WSPD-spanners
- Upper and lower bounds for fully retroactive graph problems
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Sparse graphs are near-bipartite
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Rapidly computing the phylogenetic transfer index
- Bottleneck spanning tree interdiction problem with fixed and linear costs
- Fast reoptimization for the minimum spanning tree problem
- Isometric universal graphs
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Tight bounds for online weighted tree augmentation
- Approximating minimum cuts under insertions
- Complexity models for incremental computation
- Maintaining dynamic minimum spanning trees: an experimental study
- Confluently persistent tries for efficient version control
- Topologically trivial closed walks in directed surface graphs
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
- Dynamic maintenance of shortest path trees in simple polygons
- Succinct indices for path minimum, with applications
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Speed scaling on parallel processors with migration
- Dictionary matching with uneven gaps
- Single-machine scheduling with positional due indices and positional deadlines
- Dynamic connectivity in disk graphs
- Minimum cuts and sparsification in hypergraphs
- General compact labeling schemes for dynamic trees
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Engineering a combinatorial Laplacian solver: lessons learned
- Faster approximate diameter and distance oracles in planar graphs
- A survey on combinatorial optimization in dynamic environments
- A fast maximum flow algorithm
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Parallel methods for visibility and shortest-path problems in simple polygons
- Minimum-cost flow algorithms: an experimental evaluation
- Hierarchical categories in colored searching
- Transitions in geometric minimum spanning trees
- Simplifications and speedups of the pseudoflow algorithm
- A faster algorithm for computing the principal sequence of partitions of a graph
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- A parallel algorithm for finding a blocking flow in an acyclic network
- Competitive Online Search Trees on Trees
- Computing on a free tree via complexity-preserving mappings
- Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
- scientific article; zbMATH DE number 7651141 (Why is no real title available?)
- Efficient algorithms for computing Reeb graphs
- scientific article; zbMATH DE number 7561396 (Why is no real title available?)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- Shortest augmenting paths for online matchings on trees
- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
- The Generalized Stable Allocation Problem
- Two flow network simplification algorithms
- Near-optimal distributed computation of small vertex cuts
- Edit distance between unrooted trees in cubic time
- Scaling algorithms for network problems
- A constructive arboricity approximation scheme
- Maintaining Reeb graphs of triangulated 2-manifolds
- Labelled trees and pairs of input--output permutations in priority queues
- Dynamic suffix tree and two-dimensional texts management
- Document retrieval with one wildcard
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- A heuristic method for solving integer-valued decompositional multiindex problems
- Maintaining bridge-connected and biconnected components on-line
- Near-entropy hotlink assignments
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- A faster algorithm for matching a set of patterns with variable length don't cares
- Reconstructing edge-disjoint paths faster
- Fully dynamic biconnectivity in graphs
- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
- Matching a set of strings with variable length don't cares
This page was built for publication: A data structure for dynamic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838310)
