A data structure for dynamic trees
From MaRDI portal
Cites work
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- An Efficient Method for Storing Ancestor Information in Trees
- 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
- 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?)
- 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 mechanism design
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Two flow network simplification algorithms
- New labeling procedures for the basis graph in generalized networks
- Scaling algorithms for network problems
- On-line updating of solutions to a class of matroid intersection problems
- Computing on a free tree via complexity-preserving mappings
- On finding most uniform spanning trees
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- Finding paths and deleting edges in directed acyclic graphs
- Algorithms for multicommodity flows in planar graphs
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Finding minimum-cost flows by double scaling
- Maintaining bridge-connected and biconnected components on-line
- Forests, frames, and games: Algorithms for matroid sums and applications
- On the computational behavior of a polynomial-time network flow algorithm
- A new Karzanov-type O(n^ 3) max-flow algorithm
- Transitions in geometric minimum spanning trees
- Parallel methods for visibility and shortest-path problems in simple polygons
- A parallel algorithm for finding a blocking flow in an acyclic network
- An O(m n) algorithm for the max+sum spanning tree problem
- Labelled trees and pairs of input--output permutations in priority queues
- Computational investigations of maximum flow algorithms
- Diagnosing infeasibilities in network flow problems
- Network flow and 2-satisfiability
- Complexity models for incremental computation
- Dynamic dictionary matching
- Dynamic expression trees
- A note on finding compact sets in graphs represented by an adjacency list
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Matching a set of strings with variable length don't cares
- On indexed data broadcast
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- Incremental Voronoi diagrams
- Avoiding the global sort: a faster contour tree algorithm
- Dynamic planar embeddings of dynamic graphs
- Sorting signed permutations by reversals using link-cut trees
- Dictionary matching with a bounded gap in pattern or in text
- Engineering a combinatorial Laplacian solver: lessons learned
- Shortest augmenting paths for online matchings on trees
- Reconstructing edge-disjoint paths faster
- Local search for the Steiner tree problem in the Euclidean plane
- The nearest common ancestor in a dynamic tree
- Incremental convex planarity testing
- Matching games with partial information
- A generalization of the scaling max-flow algorithm
- Fully dynamic biconnectivity in graphs
- Linear-size nonobtuse triangulation of polygons
- Average case analysis of dynamic geometric optimization
- A multifacility location problem on median spaces
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- On weighting two criteria with a parameter in combinatorial optimization problems
- I/O efficient dynamic data structures for longest prefix queries
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- General compact labeling schemes for dynamic trees
- Faster algorithms for stable allocation problems
- Fast compressed self-indexes with deterministic linear-time construction
- Faster approximate diameter and distance oracles in planar graphs
- Single-machine scheduling with positional due indices and positional deadlines
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- Horton-Strahler number, rooted pathwidth and upward drawings of trees
- Faster compressed quadtrees
- The fast algorithm for online \(k\)-server problem on trees
- Fault tolerant depth first search in undirected graphs: simple yet efficient
- String indexing for top-\(k\) close consecutive occurrences
- Mincut sensitivity data structures for the insertion of an edge
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- Dynamic and internal longest common substring
- Topologically trivial closed walks in directed surface graphs
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- A heuristic method for solving integer-valued decompositional multiindex problems
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- A brief history of parameterized matching problems
- Space-efficient fully dynamic DFS in undirected graphs
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- A simple, faster method for kinetic proximity problems
- Succinct indices for path minimum, with applications
- Free multiflows in bidirected and skew-symmetric graphs
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Speed scaling on parallel processors with migration
- Efficient regularized isotonic regression with application to gene-gene interaction search
- Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
- Shape matching and modeling using skeletal context
- A note on the parametric maximum flow problem and some related reoptimization issues
- Dynamic hotlinks
- Some inverse optimization problems under the Hamming distance
- Linear-space data structures for range frequency queries on arrays and trees
- Single-pass streaming algorithms to partition graphs into few forests
- Trade-offs in dynamic coloring for bipartite and general graphs
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Fast algorithms for convex cost flow problems on circles, lines, and trees
- Fast compressed tries through path decompositions
- Dynamic suffix tree and two-dimensional texts management
- Document retrieval with one wildcard
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
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)
