Applications of Path Compression on Balanced Trees
From MaRDI portal
Cited in
(47)- A linear-time algorithm for a special case of disjoint set union
- Linear verification for spanning trees
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Computing on a free tree via complexity-preserving mappings
- Finding the \(k\) smallest spanning trees
- Parallel search algorithms for graphs and trees
- A fast and simple Steiner routing heuristic
- Optimal binary trees with order constraints
- Efficient algorithms for finding the most vital edge of a minimum spanning tree
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- A simpler minimum spanning tree verification algorithm
- The tree longest detour problem in a biconnected graph.
- A faster computation of the most vital edge of a shortest path
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Approximate string matching on Ziv--Lempel compressed text
- A data structure for dynamic trees
- Distributed verification of minimum spanning trees
- Faster algorithm to find anti-risk path between two nodes of an undirected graph
- Memory-efficient fixpoint computation
- A new algorithm for the minimum spanning tree verification problem
- Optimal parallel verification of minimum spanning trees in logarithmic time
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Faster swap edge computation in minimum diameter spanning trees
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Strong articulation points and strong bridges in large scale graphs
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- A Path Cover Technique for LCAs in Dags
- Path Minima in Incremental Unrooted Trees
- Finding dominators via disjoint set union
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
- Computing all the best swap edges distributively
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree∗
- The saga of minimum spanning trees
- Improved filtering for weighted circuit constraints
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
- Finding the k smallest spanning trees
- A simpler minimum spanning tree verification algorithm
- Linear-time algorithm for long LCF with k mismatches
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
- Improved algorithms for the Steiner problem in networks
- A weight-scaling algorithm for \(f\)-factors of multigraphs
- Tight bounds on the message complexity of distributed tree verification
- Memory-efficient fixpoint computation
- Set selection with uncertain weights: non-adaptive queries and thresholds
- Properties of data flow frameworks: A unified model
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
This page was built for publication: Applications of Path Compression on Balanced Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048273)
