AI Chat AI Image Generator AI Video Text to Speech

Succinct data structure for dynamic trees with faster queries

05/29/2018

∙

by Dekel Tsur, et al.

∙

∙

Navarro and Sadakane [TALG 2014] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O( n/ n) or O( n) time, and insertion or deletion of a single node in O( n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level_ancestor) from O( n) to O( n/ n).

page 1

page 2

page 3

page 4

research

∙ 09/20/2021

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees

We study the problem of designing a resilient data structure maintaining...

0 Luciano Gualà, et al. ∙

research

∙ 10/17/2020

Lazy Search Trees

We introduce the lazy search tree data structure. The lazy search tree i...

0 Bryce Sandlund, et al. ∙

research

∙ 08/07/2014

Logarithmic-Time Updates and Queries in Probabilistic Networks

In this paper we propose a dynamic data structure that supports efficien...

0 Arthur L. Delcher, et al. ∙

research

∙ 06/07/2023

Maintaining the cycle structure of dynamic permutations

We present a new data structure for maintaining dynamic permutations, wh...

0 Zsuzsanna Lipták, et al. ∙

research

∙ 08/18/2022

A Verified Implementation of B+-Trees in Isabelle/HOL

In this paper we present the verification of an imperative implementatio...

0 Niels Mündler, et al. ∙

research

∙ 06/27/2020

Reconstructing Biological and Digital Phylogenetic Trees in Parallel

In this paper, we study the parallel query complexity of reconstructing ...

0 Ramtin Afshar, et al. ∙

research

∙ 06/23/2022

A Hybrid Adjacency and Time-Based Data Structure for Analysis of Temporal Networks

Dynamic or temporal networks enable representation of time-varying edges...

0 Tanner Hilsabeck, et al. ∙