Batch-Parallel Euler Tour Trees

  title={Batch-Parallel Euler Tour Trees},
  author={Tom Tseng and Laxman Dhulipala and Guy E. Blelloch},
The dynamic trees problem is to maintain a forest undergoing edge insertions and deletions while supporting queries for information such as connectivity. [] Key ResultThe main building block for parallelizing Euler tour trees is a batch-parallel skip list data structure, which we believe may be of independent interest. Euler tour trees require a sequence data structure capable of joins and splits. Sequentially, balanced binary trees are used, but they are difficult to join or split in parallel. We show that…
Parallel Batch-Dynamic Trees via Change Propagation
This work designs the first work-efficient parallel batch-dynamic algorithm for dynamic trees that is capable of supporting both path queries and subtree queries, as well as a variety of non-local queries.
Parallel Batch-Dynamic Graph Connectivity
This paper designs a parallel batch-dynamic connectivity algorithm that is work-efficient with respect to the HDT algorithm for small batch sizes, and is asymptotically faster when the average batch size is sufficiently large.
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
This paper gives an algorithm for dynamic graph connectivity in this setting with constant communication rounds and communication cost almost linear in terms of the batch size, and illustrates the power of dynamic algorithms in the MPC model by showing that the batched version of the adaptive connectivity problem is $\mathsf{P}$-complete in the centralized setting, but sub-linear sized batches can be handled in a constant number of rounds.
Parallel Batch-Dynamic k-Clique Counting
This paper studies new batch-dynamic algorithms for $k$-clique counting, which are dynamic algorithms where the updates are batches of edge insertions and deletions, and develops an algebraic algorithm based on parallel fast matrix multiplication.
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
This paper studies dynamic HAC on edge-weighted graphs and obtains a parallel batch-dynamic algorithm that can answer queries about single-linkage graph HAC clusters and finds that dynamic graph Hac is significantly harder for other common linkage functions.
A Scalable Concurrent Algorithm for Dynamic Connectivity
This paper obtains the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice.
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees
This paper proposes a framework for algorithmically dynamizing static round-synchronous algorithms to obtain parallel batchdynamic algorithms with good bounds on their work and span, and develops the first work-efficient parallel batch-dynamic algorithm for dynamic trees that supports both subtree queries and path queries.
How Fast Can You Update Your MST?
This paper focuses specifically on the problem of maintaining a minimum spanning tree (MST), and gives an algorithm for the k-machine model that can process O(k) graph updates per O(1) rounds with high probability.
Concurrent Link-Cut Trees
This work studies the problem of parallelizing link-cut trees, which are used to solve the dynamic tree problem and serve as a foundation in important areas, such as network flow algorithms, static and dynamic graph algorithms, and computational geometry.
Fully Dynamic c-Edge Connectivity in Subpolynomial Time
We present a deterministic fully dynamic algorithm for $c$-edge connectivity problem with $n^{o(1)}$ worst case update and query time for any positive integer $c = (\log n)^{o(1)}$ for a graph with


Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
This work applies an idea used originally in parallel graph algorithms, to represent trees by Euler tours, to the implementation of two versions of the network simplex algorithm, resulting in a time of O(logn) per pivot, wheren is the number of vertices in the problem network.
Randomized dynamic graph algorithms with polylogarithmic time per operation
This paper presents the first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarithmic time per edge insertion or deletion using a new dynamic technique that combines a novel graph decomposition with randomization.
Maintaining information in fully dynamic trees with top trees
Top trees are designed as a new simpler interface for data structures maintaining information in a fully dynamic forest and how easy and versatile they are to use on a host of different applications are demonstrated.
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices
Dynamic graph connectivity in polylogarithmic worst case time
The technique can be used to simplify and significantly speed up the preprocessing time for the emergency planning problem while matching previous bounds for an update, and to approximate the sizes of cutsets of dynamic graphs in time O(min{|S|, |V\S|}) for an oblivious adversary.
Near-optimal fully-dynamic graph connectivity
Near-optimal bounds for fullydynamic graph connectivity which is the most basic nontrivial fully-d dynamic graph problem are presented and some comparatively trivial observations are made improving some deterministic bounds.
Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity
This paper presents the first shared-memory parallel algorithm for IGC and equivalently, Union-Find that is provably work-efficient i.e., does no more work than the sequential optimal and has polylogarithmic parallel depth.
Parallel algorithms for red-black trees
Parallel tree contraction and its application
  • G. Miller, J. Reif
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
A bottom-up algorithm to handle trees which has two major advantages over the top-down approach: the control structure is straight forward and easier to implement facilitating new algorithms using fewer processors and less time; and problems for which it was too difficult or too complicated to find polylog parallel algorithms are now easy.
Randomized search trees
A randomized strategy for maintaining balance in dynamically changing search trees that has optimalexpected behavior, and generalizes naturally to weighted trees, where the expected time bounds for accesses and updates again match the worst-case time bounds of the best deterministic methods.