Incremental Edge Orientation in Forests

07/05/2021
by   Michael A. Bender, et al.
0

For any forest G = (V, E) it is possible to orient the edges E so that no vertex in V has out-degree greater than 1. This paper considers the incremental edge-orientation problem, in which the edges E arrive over time and the algorithm must maintain a low-out-degree edge orientation at all times. We give an algorithm that maintains a maximum out-degree of 3 while flipping at most O(loglog n) edge orientations per edge insertion, with high probability in n. The algorithm requires worst-case time O(log n loglog n) per insertion, and takes amortized time O(1). The previous state of the art required up to O(log n / loglog n) edge flips per insertion. We then apply our edge-orientation results to the problem of dynamic Cuckoo hashing. The problem of designing simple families ℋ of hash functions that are compatible with Cuckoo hashing has received extensive attention. These families ℋ are known to satisfy static guarantees, but do not come typically with dynamic guarantees for the running time of inserts and deletes. We show how to transform static guarantees (for 1-associativity) into near-state-of-the-art dynamic guarantees (for O(1)-associativity) in a black-box fashion. Rather than relying on the family ℋ to supply randomness, as in past work, we instead rely on randomness within our table-maintenance algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2022

Fully-dynamic α+ 2 Arboricity Decomposition and Implicit Colouring

In the implicit dynamic colouring problem, the task is to maintain a rep...
research
09/28/2022

Adaptive Out-Orientations with Applications

We give simple algorithms for maintaining edge-orientations of a fully-d...
research
01/17/2023

Engineering Fully Dynamic Δ-Orientation Algorithms

A (fully) dynamic graph algorithm is a data structure that supports edge...
research
11/12/2017

Dynamic Algorithms for Graph Coloring

We design fast dynamic algorithms for proper vertex and edge colorings i...
research
11/09/2022

Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window)

Dynamic algorithms come in three main flavors: 𝑖𝑛𝑐𝑟𝑒𝑚𝑒𝑛𝑡𝑎𝑙 (insertions-o...

Please sign up or login with your details

Forgot password? Click here to reset